Kleene's recursion theorem
Kleene's recursion theorem proper noun: 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.
Proper noun
Kleene's recursion theorem (plural Kleene's recursion theorems)
- 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.
Forms of Kleene's recursion theorem
| plural | Kleene's recursion theorems |
|---|
Origin of Kleene's recursion theorem
Named after mathematician Stephen Cole Kleene.
Questions about Kleene's recursion theorem
- What does Kleene's recursion theorem mean?
- Kleene's recursion theorem means 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.
- What part of speech is Kleene's recursion theorem?
- Kleene's recursion theorem is a proper noun.
Words near Kleene's recursion theorem in the dictionary
Source and license
Adapted from Wiktionary: Kleene's recursion theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Kleene's recursion theorem.” Word.ws, https://word.ws/kleene%27s_recursion_theorem. Based on Wiktionary, CC BY-SA 4.0.