"co-recursively enumerable" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co",
        "3": "recursively enumerable"
      },
      "expansion": "co- + recursively enumerable",
      "name": "prefix"
    }
  ],
  "etymology_text": "From co- + recursively enumerable.",
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "co-recursively enumerable"
      },
      "expansion": "co-recursively enumerable (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 co-",
          "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"
        }
      ],
      "examples": [
        {
          "text": "Any recursively enumerable set which is also co-recursively enumerable is a decidable set.",
          "type": "example"
        }
      ],
      "glosses": [
        "Describing a set for which there exists a deterministic algorithm that will list all items not in that set."
      ],
      "id": "en-co-recursively_enumerable-en-adj-U8aenZGU",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "set",
          "set"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Describing a set for which there exists a deterministic algorithm that will list all items not in that set."
      ],
      "synonyms": [
        {
          "word": "corecursively enumerable"
        },
        {
          "word": "co-r.e."
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "co-recursively enumerable"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "co",
        "3": "recursively enumerable"
      },
      "expansion": "co- + recursively enumerable",
      "name": "prefix"
    }
  ],
  "etymology_text": "From co- + recursively enumerable.",
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "co-recursively enumerable"
      },
      "expansion": "co-recursively enumerable (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 co-",
        "English terms with usage examples",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "text": "Any recursively enumerable set which is also co-recursively enumerable is a decidable set.",
          "type": "example"
        }
      ],
      "glosses": [
        "Describing a set for which there exists a deterministic algorithm that will list all items not in that set."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "set",
          "set"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Describing a set for which there exists a deterministic algorithm that will list all items not in that set."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "corecursively enumerable"
    },
    {
      "word": "co-r.e."
    }
  ],
  "word": "co-recursively enumerable"
}