This short chapter describes what it means for a problem to be algorithmically unsolvable and gives a proof that the halting problem is algorithmically unsolvable. After studying this material you should be able to:
-
1.
Explain what it means for a problem to be algorithmically unsolvable.
-
2.
Describe the halting problem and explain the proof of its unsolvability.
-
3.
Describe the program equivalence problem and the verification problem and explain what their algorithmic unsolvability means.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
Lover, R. (2008). Algorithmic Unsolvability Proofs. In: Elementary Logic. Springer, London. https://doi.org/10.1007/978-1-84800-082-7_18
Download citation
DOI: https://doi.org/10.1007/978-1-84800-082-7_18
Publisher Name: Springer, London
Print ISBN: 978-1-84800-081-0
Online ISBN: 978-1-84800-082-7
eBook Packages: Computer ScienceComputer Science (R0)