COMS W3261 CS Theory
Lecture 12: Turing Machines

1. Turing Machines

2. Algorithms and Recursive Languages

3. Some History

4. Models of Computation Equivalent to Turing Machines

5. Practice Problems

  1. Design a Turing machine that accepts all strings of a's and b's with an equal number of a's and b's. Show the sequence of moves your Turing machine makes on the input aabb.
  2. HMU, Exercise 8.2.5.

6. Reading