"superrecursive" meaning in All languages combined

See superrecursive on Wiktionary

Adjective [English]

Rhymes: -ɜː(ɹ)sɪv Etymology: super- + recursive, coined by Mark Burgin. Etymology templates: {{prefix|en|super|recursive}} super- + recursive Head templates: {{en-adj|-}} superrecursive (not comparable)
  1. (computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines. Wikipedia link: Super-recursive algorithm Tags: not-comparable Categories (topical): Theory of computing

Download JSON data for superrecursive meaning in All languages combined (1.6kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "recursive"
      },
      "expansion": "super- + recursive",
      "name": "prefix"
    }
  ],
  "etymology_text": "super- + recursive, coined by Mark Burgin.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "superrecursive (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 super-",
          "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": [
        "Being a generalization of ordinary algorithms that are more powerful than Turing machines."
      ],
      "id": "en-superrecursive-en-adj-AJAivSoK",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "generalization",
          "generalization"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "Turing machine",
          "Turing machine"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Super-recursive algorithm"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)sɪv"
    }
  ],
  "word": "superrecursive"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "super",
        "3": "recursive"
      },
      "expansion": "super- + recursive",
      "name": "prefix"
    }
  ],
  "etymology_text": "super- + recursive, coined by Mark Burgin.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "superrecursive (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 terms prefixed with super-",
        "English uncomparable adjectives",
        "Rhymes:English/ɜː(ɹ)sɪv",
        "en:Theory of computing"
      ],
      "glosses": [
        "Being a generalization of ordinary algorithms that are more powerful than Turing machines."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "generalization",
          "generalization"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "Turing machine",
          "Turing machine"
        ]
      ],
      "raw_glosses": [
        "(computing theory) Being a generalization of ordinary algorithms that are more powerful than Turing machines."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Super-recursive algorithm"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)sɪv"
    }
  ],
  "word": "superrecursive"
}

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-06-04 from the enwiktionary dump dated 2024-05-02 using wiktextract (e9e0a99 and db5a844). 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.