"semi-decidable" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "semi",
        "3": "decidable"
      },
      "expansion": "semi- + decidable",
      "name": "prefix"
    }
  ],
  "etymology_text": "From semi- + decidable.",
  "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 incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with semi-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "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"
        },
        {
          "word": "semidecidable"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "semi-decidable"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "semi",
        "3": "decidable"
      },
      "expansion": "semi- + decidable",
      "name": "prefix"
    }
  ],
  "etymology_text": "From semi- + decidable.",
  "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 incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English terms prefixed with semi-",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "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": "semidecidable"
    }
  ],
  "word": "semi-decidable"
}