COMS W3261 CS Theory
Lecture 13: Turing Machine Variants

1. Programming Techniques for Turing Machines

2. Extensions of the Basic Turing Machine

3. Restricted Machines Equivalent to Turing Machines

4. Other Models of Computation Equivalent to Turing Machines

5. The Church-Turing Thesis

6. Practice Problems

  1. Describe at a high level how a deterministic multitape TM can simulate a one-tape nondeterministic TM.
  2. Describe how a TM with a tape that is infinite only to the right can simulate a basic TM.
  3. Describe how a PDA with two stacks can simulate a TM.

7. Reading