"semi-decidable" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": ":af",
        "3": "semi-",
        "4": "decidable",
        "text": "+",
        "tree": "1"
      },
      "expansion": "Etymology tree\nProto-Indo-European *sem-\nProto-Indo-European *sēmi\nLatin sēmi-bor.\nEnglish semi-\nEnglish decidable\nEnglish semi-decidable\n[Appendix:Glossary#loanword|Borrowed]] from\", \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"children\" : [ ], \"lang_name\" : \"Proto-Indo-European\", \"term\" : \"*sem-\", \"status\" : \"ok\", \"lang\" : \"ine-pro\" } ], \"keyword_label\" : \"From\", \"keyword\" : \"from\" } ], \"lang_name\" : \"Proto-Indo-European\", \"term\" : \"*sēmi\", \"status\" : \"ok\", \"lang\" : \"ine-pro\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"Latin\", \"term\" : \"sēmi-\", \"status\" : \"ok\", \"lang\" : \"la\" } ], \"keyword\" : \"bor\" } ], \"lang_name\" : \"English\", \"term\" : \"semi-\", \"status\" : \"ok\", \"lang\" : \"en\" }, { \"children\" : [ ], \"lang_name\" : \"English\", \"term\" : \"decidable\", \"status\" : \"missing\", \"lang\" : \"en\" } ], \"keyword_label\" : \"From\", \"is_group\" : true, \"keyword\" : \"affix\" } ], \"lang_name\" : \"English\", \"term\" : \"semi-decidable\", \"status\" : \"ok\", \"lang\" : \"en\" }\" data-lang=\"en\" data-title=\"semi-decidable\">\nFrom semi- + decidable.",
      "name": "ety"
    }
  ],
  "etymology_text": "Etymology tree\nProto-Indo-European *sem-\nProto-Indo-European *sēmi\nLatin sēmi-bor.\nEnglish semi-\nEnglish decidable\nEnglish semi-decidable\nFrom semi- + decidable.",
  "forms": [
    {
      "form": "semidecidable",
      "tags": [
        "alternative"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "semi-decidable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with etymology texts",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with etymology trees",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with etymon",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with semi-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages using etymon with no ID",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with etymology trees",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with etymon",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "Of a set, such that there is a deterministic algorithm such that (a) if an element is a member of the set, the algorithm halts with the result \"positive\", and (b) if an element is not a member of the set, (i) the algorithm does not halt, or (ii) if it does, then with the result \"negative\"."
      ],
      "id": "en-semi-decidable-en-adj-ix6waWDQ",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Of a set, such that there is a deterministic algorithm such that (a) if an element is a member of the set, the algorithm halts with the result \"positive\", and (b) if an element is not a member of the set, (i) the algorithm does not halt, or (ii) if it does, then with the result \"negative\"."
      ],
      "synonyms": [
        {
          "word": "recursively enumerable"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "semi-decidable"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": ":af",
        "3": "semi-",
        "4": "decidable",
        "text": "+",
        "tree": "1"
      },
      "expansion": "Etymology tree\nProto-Indo-European *sem-\nProto-Indo-European *sēmi\nLatin sēmi-bor.\nEnglish semi-\nEnglish decidable\nEnglish semi-decidable\n[Appendix:Glossary#loanword|Borrowed]] from\", \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"children\" : [ ], \"lang_name\" : \"Proto-Indo-European\", \"term\" : \"*sem-\", \"status\" : \"ok\", \"lang\" : \"ine-pro\" } ], \"keyword_label\" : \"From\", \"keyword\" : \"from\" } ], \"lang_name\" : \"Proto-Indo-European\", \"term\" : \"*sēmi\", \"status\" : \"ok\", \"lang\" : \"ine-pro\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"Latin\", \"term\" : \"sēmi-\", \"status\" : \"ok\", \"lang\" : \"la\" } ], \"keyword\" : \"bor\" } ], \"lang_name\" : \"English\", \"term\" : \"semi-\", \"status\" : \"ok\", \"lang\" : \"en\" }, { \"children\" : [ ], \"lang_name\" : \"English\", \"term\" : \"decidable\", \"status\" : \"missing\", \"lang\" : \"en\" } ], \"keyword_label\" : \"From\", \"is_group\" : true, \"keyword\" : \"affix\" } ], \"lang_name\" : \"English\", \"term\" : \"semi-decidable\", \"status\" : \"ok\", \"lang\" : \"en\" }\" data-lang=\"en\" data-title=\"semi-decidable\">\nFrom semi- + decidable.",
      "name": "ety"
    }
  ],
  "etymology_text": "Etymology tree\nProto-Indo-European *sem-\nProto-Indo-European *sēmi\nLatin sēmi-bor.\nEnglish semi-\nEnglish decidable\nEnglish semi-decidable\nFrom semi- + decidable.",
  "forms": [
    {
      "form": "semidecidable",
      "tags": [
        "alternative"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "semi-decidable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with etymology texts",
        "English entries with etymology trees",
        "English entries with etymon",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English terms derived from the Proto-Indo-European root *sem-",
        "English terms prefixed with semi-",
        "English uncomparable adjectives",
        "Pages using etymon with no ID",
        "Pages with 1 entry",
        "Pages with entries",
        "Pages with etymology trees",
        "Pages with etymon",
        "en:Theory of computing"
      ],
      "glosses": [
        "Of a set, such that there is a deterministic algorithm such that (a) if an element is a member of the set, the algorithm halts with the result \"positive\", and (b) if an element is not a member of the set, (i) the algorithm does not halt, or (ii) if it does, then with the result \"negative\"."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Of a set, such that there is a deterministic algorithm such that (a) if an element is a member of the set, the algorithm halts with the result \"positive\", and (b) if an element is not a member of the set, (i) the algorithm does not halt, or (ii) if it does, then with the result \"negative\"."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "recursively enumerable"
    }
  ],
  "word": "semi-decidable"
}