O'Reilly logo

Good Math by Mark C. Chu-Carroll

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Adding a Tape Makes All the Difference

So let’s take a step back and ask, what is a Turing machine?

A Turing machine is just an extension of a finite state machine. Just like an FSM, a Turing machine has a finite set of states and a state relation that defines how it moves between them based on its input. The difference is that its inputs come on a strip of tape, and the machine can both read and write symbols on that tape, something like this:

images/pdf/turingmachine.png
Figure 16. A Turing machine: A Turing machine is a finite state machine that can read and write a tape.

The basic idea of the Turing machine is simple. Take a finite state machine. Instead of feeding ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required