Abstract
This chapter investigates the limitations of the Turing machines (TM). The limitations of the TM are, by Turing’s thesis (introduced in the last chapter), also the limitations of the digital 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
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Parkes, A.P. (2002). Computability, Solvability, and the Halting Problem. In: Introduction to Languages, Machines and Logic. Springer, London. https://doi.org/10.1007/978-1-4471-0143-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0143-7_11
Publisher Name: Springer, London
Print ISBN: 978-1-85233-464-2
Online ISBN: 978-1-4471-0143-7
eBook Packages: Springer Book Archive