Abstract
In this chapter we present a simple theorem, the recursion theorem or the fixed-point theorem of recursion theory, which provides a means for answering a number of seemingly difficult problems for precomplete numberings among which are the numberings, φ, W, and cfK, the characteristic function of the self applicability problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weihrauch, K. (1987). The Recursion Theorem. In: Computability. EATCS Monographs on Theoretical Computer Science, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69965-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-69965-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69967-2
Online ISBN: 978-3-642-69965-8
eBook Packages: Springer Book Archive