15453 Formal Languages, Automata, and Computation
Lecture 16: NonDeterministic Turing Machines
We demonstrate that nondeterminism 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 nondeterministic machine.
We then return to pushdown automata and relate them explicitly to Turing
machines.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
