@inbook{10.2307/j.cttq957s.12,
ISBN = {9780691151007},
URL = {http://www.jstor.org/stable/j.cttq957s.12},
abstract = {ATuring machineis the combination of a sequential, finite-state machine plus an external read/write memory storage medium called thetape(think of a ribbon of magnetic tape). The tape is a linear sequence of squares, with each square holding one of several possible symbols. Most generally, a Turing machine can have any number of different symbols it can recognize, but I’ll assume here that we are discussing the 2-symbol case (0 or 1). In 1956, Shannon showed that this in no way limits the power of what a Turing machine can do.The tape is arbitrarily long in at},
bookauthor = {PAUL J. NAHIN},
booktitle = {The Logician and the Engineer: How George Boole and Claude Shannon Created the Information Age},
pages = {161--175},
publisher = {Princeton University Press},
title = {Turing Machines},
year = {2013}
}