Abstract
The concept of a Turing machine was introduced in 0.4.1, as a machine that controls a read/write head moving on an infinite tape. We shall now explain the concept in more detail and give a few examples that illustrate how Turing machines compute functions and solve problems.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Stillwell, J. (1993). Unsolvable Problems. In: Classical Topology and Combinatorial Group Theory. Graduate Texts in Mathematics, vol 72. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4372-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4372-4_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97970-0
Online ISBN: 978-1-4612-4372-4
eBook Packages: Springer Book Archive