See recursive function on Wiktionary
Download JSON data for recursive function meaning in All languages combined (2.7kB)
{
"forms": [
{
"form": "recursive functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "recursive function (plural recursive functions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Computing",
"orig": "en:Computing",
"parents": [
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "59 41",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "63 37",
"kind": "other",
"name": "English entries with topic categories using raw markup",
"parents": [
"Entries with topic categories using raw markup",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "62 38",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "63 37",
"kind": "topical",
"langcode": "en",
"name": "Functions",
"orig": "en:Functions",
"parents": [
"Algebra",
"Calculus",
"Geometry",
"Mathematical analysis",
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
}
],
"glosses": [
"Any function that uses recursion and can call itself until a certain condition is met."
],
"hypernyms": [
{
"_dis1": "72 28",
"word": "function"
}
],
"hyponyms": [
{
"_dis1": "72 28",
"word": "partial recursive function"
},
{
"_dis1": "72 28",
"word": "primitive recursive function"
}
],
"id": "en-recursive_function-en-noun-2GnGuemh",
"links": [
[
"computing",
"computing#Noun"
],
[
"recursion",
"recursion"
],
[
"condition",
"condition"
]
],
"raw_glosses": [
"(computing) Any function that uses recursion and can call itself until a certain condition is met."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"id": "en-recursive_function-en-noun-BIUf3gyN",
"links": [
[
"mathematics",
"mathematics"
],
[
"value",
"value"
],
[
"finite",
"finite"
],
[
"operation",
"operation"
],
[
"algorithm",
"algorithm"
]
],
"raw_glosses": [
"(mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Computable function",
"Recursion (computer science)"
],
"word": "recursive function"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English entries with topic categories using raw markup",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with non-redundant non-automated sortkeys",
"en:Functions"
],
"forms": [
{
"form": "recursive functions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "recursive function (plural recursive functions)",
"name": "en-noun"
}
],
"hypernyms": [
{
"word": "function"
}
],
"hyponyms": [
{
"word": "partial recursive function"
},
{
"word": "primitive recursive function"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"en:Computing"
],
"glosses": [
"Any function that uses recursion and can call itself until a certain condition is met."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"recursion",
"recursion"
],
[
"condition",
"condition"
]
],
"raw_glosses": [
"(computing) Any function that uses recursion and can call itself until a certain condition is met."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"value",
"value"
],
[
"finite",
"finite"
],
[
"operation",
"operation"
],
[
"algorithm",
"algorithm"
]
],
"raw_glosses": [
"(mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm."
],
"topics": [
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Computable function",
"Recursion (computer science)"
],
"word": "recursive function"
}
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-05-03 from the enwiktionary dump dated 2024-05-02 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.