15-453 Formal Languages, Automata, and Computation
Lecture 16: Non-Deterministic Turing Machines

We demonstrate that non-determinism does not change the computational power of Turing machines. As usual, this kind of theorem is shown by constructing a deterministic machine which simulates a given non-deterministic machine. We then return to push-down automata and relate them explicitly to Turing machines.

[ Home | Schedule | Assignments | Handouts | Overview ]

Frank Pfenning