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.