See Kleene's recursion theorem in All languages combined, or Wiktionary
Download JSON data for Kleene's recursion theorem meaning in English (2.4kB)
{
"etymology_text": "Named after mathematician Stephen Cole Kleene.",
"forms": [
{
"form": "Kleene's recursion theorems",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "s"
},
"expansion": "Kleene's recursion theorem (plural Kleene's recursion theorems)",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"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": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
],
"id": "en-Kleene's_recursion_theorem-en-name-iLJPrcNV",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"fundamental",
"fundamental"
],
[
"result",
"result"
],
[
"application",
"application"
],
[
"computable function",
"computable function"
],
[
"description",
"description"
],
[
"fixed point",
"fixed point"
],
[
"operation",
"operation"
],
[
"quine",
"quine"
],
[
"function",
"function"
],
[
"recursive",
"recursive"
],
[
"definition",
"definition"
]
],
"raw_glosses": [
"(computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
],
"related": [
{
"word": "Kleene's theorem"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Kleene's recursion theorem"
}
{
"etymology_text": "Named after mathematician Stephen Cole Kleene.",
"forms": [
{
"form": "Kleene's recursion theorems",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "s"
},
"expansion": "Kleene's recursion theorem (plural Kleene's recursion theorems)",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"related": [
{
"word": "Kleene's theorem"
}
],
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English terms with non-redundant non-automated sortkeys",
"English uncountable nouns",
"en:Theory of computing"
],
"glosses": [
"Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"fundamental",
"fundamental"
],
[
"result",
"result"
],
[
"application",
"application"
],
[
"computable function",
"computable function"
],
[
"description",
"description"
],
[
"fixed point",
"fixed point"
],
[
"operation",
"operation"
],
[
"quine",
"quine"
],
[
"function",
"function"
],
[
"recursive",
"recursive"
],
[
"definition",
"definition"
]
],
"raw_glosses": [
"(computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Kleene's recursion theorem"
}
This page is a part of the kaikki.org machine-readable English 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.