18.404J / 6.840J Theory of Computation, Fall 2002
Image of cover of Prof. Sipser's textbook
. (Courtesy of Thomson/Course Technology. Used with permission.)
Highlights of this Course
A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.