Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Rather like the person who says: “Everything I say is a lie”.
- 2.
UTM H was introduced earlier in the chapter. It halts and prints 1 when the simulated machine would have halted on the given tape, and thus partially solves the halting problem.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
Parkes, A.P. (2008). Computability, Solvability and the Halting Problem. In: A Concise Introduction to Languages and Machines. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84800-121-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-84800-121-3_11
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84800-120-6
Online ISBN: 978-1-84800-121-3
eBook Packages: Computer ScienceComputer Science (R0)