Abstract
In the previous chapters we have developed a theory of computability based on while-programs. The legitimacy of this programming language approach has rested on the belief, embodied in Church’s Thesis, that the class of computable functions is model invariant: The while-program computable functions include the function classes that are definable by any other system, so long as that system matches our informal notion of algorithmic specification.
This is a preview of subscription content, log in via an institution to check access.
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
© 1982 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Kfoury, A.J., Moll, R.N., Arbib, M.A. (1982). Alternative Approaches to Computability. In: A Programming Approach to Computability. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5749-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5749-3_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-5751-6
Online ISBN: 978-1-4612-5749-3
eBook Packages: Springer Book Archive