15453 Formal Languages, Automata, and Computation
Lecture 14: Turing Machines
We introduce a yet more powerful model of computation: Turing machines.
They were designed to embody the intuitive notion of what may be computed
by an algorithm. Turing machines still only have a finite number of
states, but they have an infinite tape which may be traversed in
both directions.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
