
Professor Michael Sipser teaching Lecture 14 of Theory of Computation. (Image by MIT OpenCourseWare.)
Course Description
This course emphasizes computability and computational complexity theory. Topics include 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.
Instructor: | |
Course Number: |
|
Departments: | |
Topics: | |
As Taught In: | Fall 2020 |
Level: |
Undergraduate
Graduate |
Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
grading
Exams
notes
Lecture Notes
Instructor Insights