University: Massachusetts Institute of Technology
Instructors: Prof. Michael Sipser
Course Number: 18.404J
This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.
You need some facility with the mathematical concepts of theorem and proof. Most of the assignments in this course require proving some statement and some creativity in finding the proof will be necessary.
This course is taught using Professor Sipser's textbook:
Please see the table of contents for both the first and second editions. (PDF)
There is an errata for 2nd edition of textbook.