Kleene's recursion theorem
English edit
Etymology edit
Named after mathematician Stephen Cole Kleene.
Proper noun edit
Kleene's recursion theorem (plural Kleene's recursion theorems)
- (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.