18.404 Theory of Computation
A more extensive and theoretical treatment of the material in 6.045J/18.400J, 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.
18.404 will be offered this semester (Fall 2017). It is instructed by M. Sipser.
Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 2-190.
This class counts for a total of 12 credits.
You can find more information at the 18.404/6.840 Introduction to the Theory of Computation site or on the 18.404 Stellar site.
© Copyright 2015 Yasyf Mohamedali