This is an archived page and may be obsolete; the current pages are at

CS 530: Theory of Computation


This course discusses basic computation models including finite automata, push-down automata, and Turing machines. Recursive function theory and logical theories will also be discussed. Computability issues (including undecidability) as well as complexity issues related to the various models will also be discussed.


CS 430 and a formal languages course.


Edited March 2006 (html, css checks)