OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Kleene's recursion theorem

 Home Mathematics Fields of mathematics Foundations of mathematics Theorems in the foundations of mathematics
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Kleene's recursion theorem, named after mathematician Stephen Cole Kleene, is a fundamental result in the field of computability theory. It addresses the existence of computable functions that can be defined recursively. The theorem states that for any total computable function \( f \), there exists a program (or particular index in the sense of the arithmetical hierarchy) that produces itself as an output when given its own index (or code) as input.

 Ancestors (5)

  1. Theorems in the foundations of mathematics
  2. Foundations of mathematics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook