Abstract
This final chapter returns to the topic of the first chapter: What is an algorithm?
We give Alan Turing’s answer to that question and end our story with a disappointing result: namely, that we can prove that there is no algorithm that can solve the halting problem. But this result assures us that machines cannot replace human minds with their creativity and ingenuity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Jenkyns, T., Stephenson, B. (2018). Turing Machines. In: Fundamentals of Discrete Math for Computer Science. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70151-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-70151-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70150-9
Online ISBN: 978-3-319-70151-6
eBook Packages: Computer ScienceComputer Science (R0)