15453 Formal Languages, Automata, and Computation
Lecture 15: Variants of Turing Machines
We give more examples of Turing machines, gathering evidence that Turing
machines are indeed a universal model of computation. We then consider some
variations of Turing machines which all turn out to have the same computational
power.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
