18.404 Theory of Computation

Class Info

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.

This class has 6.042, and 18.200 as prerequisites.

18.404 will be offered this semester (Fall 2019). It is instructed by M. Sipser.

This class counts for a total of 12 credits.

You can find more information at the MIT + 18.404 - Google Search site.

MIT 18.404 Theory of Computation Related Textbooks
MIT 18.404 Theory of Computation On The Web

© Copyright 2015