Abstract
What are the capabilities and limitations of computers? Are they glorified adding machines capable of superfast arithmetic computations and nothing else? Can they outdo man in the variety of problems they can handle? Let’s narrow the question a bit. Consider the class of number theoretic functions that a computer can be programmed to compute or that a man can be instructed to compute. Are any of these functions computable by a computer but not by a man, or by a man but not by a computer? Is there a number theoretic function that is not computable by any computer, and if so, can such functions be described? Is there a computer that can be programmed to compute any function that any other computer can compute? Is man such a computer?
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
© 1979 Springer-Verlag New York Inc
About this chapter
Cite this chapter
Malitz, J. (1979). An Introduction to Computability Theory. In: Introduction to Mathematical Logic. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9441-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9441-9_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9443-3
Online ISBN: 978-1-4613-9441-9
eBook Packages: Springer Book Archive