Content deleted Content added
m Task 18 (cosmetic): eval 9 templates: del |url-status= (6×); cvt lang vals (9×); |
Finnusertop (talk | contribs) →top: {{Format footnotes|date=January 2021|reason=Parenthetical referencing has been deprecated; convert to shortened footnotes.}} |
||
Line 1:
{{Use Harvard referencing|date=August 2020}}
{{distinguish|text=[[Kleene's theorem]] for regular languages}}
{{Format footnotes|date=January 2021|reason=Parenthetical referencing has been [[WP:PARREF|deprecated]]; convert to [[Help:Shortened footnotes|shortened footnotes]].}}
In [[computability theory]], '''Kleene's recursion theorems''' are a pair of fundamental results about the application of [[computable function]]s to their own descriptions. The theorems were first proved by [[Stephen Cole Kleene|Stephen Kleene]] in 1938 and appear in his 1952 book ''[[#CITEREFKleene1952|Introduction to Metamathematics]]''. A related theorem which constructs fixed points of a computable function is known as '''Rogers's theorem''' and is due to [[Hartley Rogers, Jr.]] {{harv|Rogers|1967}}.
| |||