6.045[J] Automata, Computability, and Complexity
Provides an introduction to some of the central ideas of theoretical computer science, including circuits, finite automata, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography, computational learning theory, and quantum computing. Examines the classes of problems that can and cannot be solved in various computational models.
This class has 6.042 as a prerequisite.
6.045[J] will not be offered this semester. It will be instructed by S. Aaronson.
Lecture occurs 9:30 AM to 11:00 AM on Tuesdays and Thursdays in 34-101.
This class counts for a total of 12 credits. This is a graduate-level class.
You can find more information at the Scott Aaronson site.
© Copyright 2015 Yasyf Mohamedali