Abstract
In this lecture we introduce the most powerful of the automata we will study: Turing machines (TMs), named after Alan Turing, who invented them in 1936. Turing machines can compute any function normally considered computable; in fact, it is quite reasonable to define computable to mean computable by a TM.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1977). Turing Machines and Effective Computability. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-85706-5_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85708-9
Online ISBN: 978-3-642-85706-5
eBook Packages: Springer Book Archive