Catalog Description: CS385/Math385 (3 cr). Mathematical models of computation, including finite automata and Turing machines.
This course is an introduction to the teory of computation. The goal of the theory of computation is to define mathematically what problems can and cannot be solved using a computer, i.e. to define the limits of computation. This is done by creating simple, well defined models of computing machines, such as finite automata, pushdown automata, and Turing machines. Using these models it is then possible to rigorously define computation.
Meeting times:
11:30-12:20 MWF
Group office hour 3:00-4:00 Tuesday in JEB 221