This is an archived page and may be obsolete; the current pages are at http://www.iit.edu/csl/cs

CS 530: Theory of Computation

Objectives

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.

Prerequisites

CS 430 and a formal languages course.

Syllabus

Edited March 2006 (html, css checks)