"recursively enumerable" meaning in All languages combined

See recursively enumerable on Wiktionary

Adjective [English]

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

{
  "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": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Czech translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Finnish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with German translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Hebrew translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Polish translations",
          "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"
        }
      ],
      "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",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Terms with Czech translations",
        "Terms with Finnish translations",
        "Terms with German translations",
        "Terms with Hebrew translations",
        "Terms with Polish translations",
        "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"
}

Download raw JSONL data for recursively enumerable meaning in All languages combined (2.6kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-09-22 from the enwiktionary dump dated 2024-09-20 using wiktextract (af5c55c and 66545a6). 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.