O'Reilly logo

Theory of Computation by George Tourlakis

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

2.9 THE RECURSION THEOREM

The recursion theorem, by that name, is due to Kleene but owes its existence (and proof) to the work of Gödel (1931) on the incompleteness phenomenon. We look at few versions of this very powerful tool in what follows, and then come back to this comment regarding the connection with Gödel’s work.

2.9.0.26 Theorem. (Kleene’s Recursion Theorem) If ImageszImages.f (z, Imagesn) images Images, then for some e, we have Images (Imagesn) ⋍ f (e, Imagesn), for all Imagesn.

Proof. Let Images. Then

        by 2.6.0.38

Take e = (a, a).          □ ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required