6.045 Automata, Computability, and Complexity
Mathematical introduction to questions concerning the definition of computation, and what problems can be solved by computers. Considers what problems can be efficiently solved by way of finite automata, circuits, Turing machines, and communication complexity. Provides complete, rigorous answers to the questions in some cases; others are major open problems. Builds skills in classifying computational problems in terms of their difficulty. Discusses other fundamental issues, including the Church-Turing Thesis, the P versus NP problem, and the power of randomness.
This class has 6.042 as a prerequisite.
6.045 will be offered this semester (Spring 2018). It is instructed by R. Williams.
Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 32-155.
This class counts for a total of 12 credits.
You can find more information at the 6.045: Automata, Computability, and Complexity Theory site or on the 6.045 Stellar site.
© Copyright 2015 Yasyf Mohamedali