See primitive recursion on Wiktionary
{
"forms": [
{
"form": "primitive recursions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "primitive recursion (countable and uncountable, plural primitive recursions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "48 52",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Recursion to a fixed depth."
],
"id": "en-primitive_recursion-en-noun-kxzsqoHx",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"Recursion",
"recursion"
],
[
"fixed",
"fixed"
],
[
"depth",
"depth"
]
],
"raw_glosses": [
"(computing theory) Recursion to a fixed depth."
],
"related": [
{
"_dis1": "74 26",
"word": "primitive recursive"
},
{
"_dis1": "74 26",
"word": "recursion"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "48 52",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"The operator ρ, that creates a new function from two functions g, and h, such that"
],
"id": "en-primitive_recursion-en-noun-LgHSPx0u",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"operator",
"operator"
],
[
"function",
"function"
]
],
"raw_glosses": [
"(computing theory) The operator ρ, that creates a new function from two functions g, and h, such that:"
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "primitive recursion"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries"
],
"forms": [
{
"form": "primitive recursions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "primitive recursion (countable and uncountable, plural primitive recursions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "primitive recursive"
},
{
"word": "recursion"
}
],
"senses": [
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"Recursion to a fixed depth."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"Recursion",
"recursion"
],
[
"fixed",
"fixed"
],
[
"depth",
"depth"
]
],
"raw_glosses": [
"(computing theory) Recursion to a fixed depth."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"The operator ρ, that creates a new function from two functions g, and h, such that"
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"operator",
"operator"
],
[
"function",
"function"
]
],
"raw_glosses": [
"(computing theory) The operator ρ, that creates a new function from two functions g, and h, such that:"
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "primitive recursion"
}
Download raw JSONL data for primitive recursion meaning in All languages combined (1.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 2025-01-03 from the enwiktionary dump dated 2025-01-01 using wiktextract (eaedd02 and 8fbd9e8). 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.