See recursion theory on Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "recursion theory (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Logic",
"orig": "en:Logic",
"parents": [],
"source": "w"
}
],
"glosses": [
"A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
],
"id": "en-recursion_theory-en-noun-Jzyp78jj",
"links": [
[
"logic",
"logic"
],
[
"mathematical logic",
"mathematical logic"
],
[
"computable function",
"computable function"
],
[
"Turing degree",
"Turing degree"
]
],
"raw_glosses": [
"(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
],
"synonyms": [
{
"word": "computability theory"
}
],
"tags": [
"uncountable"
],
"topics": [
"human-sciences",
"logic",
"mathematics",
"philosophy",
"sciences"
],
"wikipedia": [
"recursion theory"
]
}
],
"word": "recursion theory"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "recursion theory (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Logic"
],
"glosses": [
"A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
],
"links": [
[
"logic",
"logic"
],
[
"mathematical logic",
"mathematical logic"
],
[
"computable function",
"computable function"
],
[
"Turing degree",
"Turing degree"
]
],
"raw_glosses": [
"(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as \"What does it mean for a function on the natural numbers to be computable?\" and \"Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?\"."
],
"tags": [
"uncountable"
],
"topics": [
"human-sciences",
"logic",
"mathematics",
"philosophy",
"sciences"
],
"wikipedia": [
"recursion theory"
]
}
],
"synonyms": [
{
"word": "computability theory"
}
],
"word": "recursion theory"
}
Download raw JSONL data for recursion theory meaning in All languages combined (1.4kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-05-27 from the enwiktionary dump dated 2025-05-20 using wiktextract (a4e883e and f1c2b61). 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.