"recursively enumerable" meaning in English

See recursively enumerable in All languages combined, or Wiktionary

Adjective

Head templates: {{en-adj|-|head=recursively enumerable}} recursively enumerable (not comparable)
  1. (computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others. Wikipedia link: recursively enumerable Tags: not-comparable Categories (topical): Theory of computing Synonyms: r.e. Derived forms: co-recursively enumerable Translations (computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others): rekurzivně spočetný (Czech), rekursiivisesti numeroituva (Finnish), rekusiv aufzählbar (German), ניתן למניה רקורסיבית (nitán lemenayá rekursívit) (Hebrew), rekurencyjnie przeliczalny [masculine] (Polish)

Alternative forms

Download JSON data for recursively enumerable meaning in English (2.9kB)

{
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "recursively enumerable"
      },
      "expansion": "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 entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "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"
        }
      ],
      "derived": [
        {
          "word": "co-recursively enumerable"
        }
      ],
      "glosses": [
        "Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others."
      ],
      "id": "en-recursively_enumerable-en-adj-UcTu5~-G",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "set",
          "set"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others."
      ],
      "synonyms": [
        {
          "word": "r.e."
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "translations": [
        {
          "code": "cs",
          "lang": "Czech",
          "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
          "word": "rekurzivně spočetný"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
          "word": "rekursiivisesti numeroituva"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
          "word": "rekusiv aufzählbar"
        },
        {
          "code": "he",
          "lang": "Hebrew",
          "roman": "nitán lemenayá rekursívit",
          "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
          "word": "ניתן למניה רקורסיבית"
        },
        {
          "code": "pl",
          "lang": "Polish",
          "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
          "tags": [
            "masculine"
          ],
          "word": "rekurencyjnie przeliczalny"
        }
      ],
      "wikipedia": [
        "recursively enumerable"
      ]
    }
  ],
  "word": "recursively enumerable"
}
{
  "derived": [
    {
      "word": "co-recursively enumerable"
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "-",
        "head": "recursively enumerable"
      },
      "expansion": "recursively enumerable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English adverb-adjective phrases",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English lemmas",
        "English multiword terms",
        "English terms with non-redundant non-automated sortkeys",
        "English uncomparable adjectives",
        "en:Theory of computing"
      ],
      "glosses": [
        "Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "set",
          "set"
        ],
        [
          "deterministic",
          "deterministic"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "recursively enumerable"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "r.e."
    }
  ],
  "translations": [
    {
      "code": "cs",
      "lang": "Czech",
      "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
      "word": "rekurzivně spočetný"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
      "word": "rekursiivisesti numeroituva"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
      "word": "rekusiv aufzählbar"
    },
    {
      "code": "he",
      "lang": "Hebrew",
      "roman": "nitán lemenayá rekursívit",
      "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
      "word": "ניתן למניה רקורסיבית"
    },
    {
      "code": "pl",
      "lang": "Polish",
      "sense": "computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others",
      "tags": [
        "masculine"
      ],
      "word": "rekurencyjnie przeliczalny"
    }
  ],
  "word": "recursively enumerable"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.