| Display title | Kleene's recursion theorem |
| Default sort key | Kleene's recursion theorem |
| Page length (in bytes) | 21,343 |
| Namespace ID | 0 |
| Page ID | 231351 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>WikiEd2 |
| Date of page creation | 19:55, 6 February 2024 |
| Latest editor | imported>WikiEd2 |
| Date of latest edit | 19:55, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book Introduction to Metamathematics. A related theorem, |
