Abstract
In this chapter we shall present a popular mathematical version of effectiveness, Turing computability, which will form our main rigorous basis for the mathematical discussion of effectivity. Actually in this section we present only some of the basic definitions concerning Turing machines and some elementary results which both illuminate these definitions and form a basis for later work. The definition of Turing computability itself is found in Chapter 3. After giving the formal definition of a Turing machine we discuss briefly the motivation behind the definition.
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.
Bibliography
Davis, M. Computability and Unsolvability. New York: McGraw-Hill (1958).
Hermes, H. Enumerability, Decidability, Computability, 2nd ed. New York: Springer (1969).
Minsky, M. Computation. Englewood Cliffs: Prentice-Hall (1967).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Turing Machines. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9454-9
Online ISBN: 978-1-4684-9452-5
eBook Packages: Springer Book Archive