CS 488 - Theory of Computation

Mathematical models of computation including finite and pushdown automata and Turing machines and equivalence of different general-purpose models. Grammars and their relation to automata, Church’s Thesis, and limits of computation.

Preparation for Course
P: 350.

Cr. 3.
Notes
If you are majoring in this discipline, you may want to consider the Science and Engineering Research Semester. See information under Arts and Sciences (Part 3).