Jump to ContentJump to Main Navigation
The Logician and the EngineerHow George Boole and Claude Shannon Created the Information Age$
Users without a subscription are not able to see the full content.

Paul J. Nahin

Print publication date: 2017

Print ISBN-13: 9780691176000

Published to Princeton Scholarship Online: May 2018

DOI: 10.23943/princeton/9780691176000.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2022. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 05 July 2022

Turing Machines

Turing Machines

(p.161) 9 Turing Machines
The Logician and the Engineer

Paul J. Nahin

Princeton University Press

This chapter discusses Turing machines. A Turing machine is the combination of a sequential, finite-state machine plus an external read/write memory storage medium called the tape (think of a ribbon of magnetic tape). The tape is a linear sequence of squares, with each square holding one of several possible symbols. The Turing machine's power to compute comes from its tape, for two reasons. First, Turing was the first to conceive of the idea of a stored program that could be changed by the operation of the machine itself. The program, and its input data, exist together on the tape as sequences of symbols. Second, because of the arbitrarily long length of the tape, a Turing machine has the ability to “remember” what has happened in the arbitrarily distant past.

Keywords:   Turing machines, computing machines, Boolean algebra, mathematics

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.