Abstract
As mentioned, the concept of computability is remarkably robust. As evidence of this, we will present several different flavors of Turing machines that at first glance appear to be significantly more or less powerful than the basic model defined in Lecture 29 but in fact are computationally equivalent.
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
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1997). Equivalent Models. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_38
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_38
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7309-7
Online ISBN: 978-1-4612-1844-9
eBook Packages: Springer Book Archive