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, …
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.
Course Info
Learning Resource Types
edit_note
Editable Files
grading
Exams
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
assignment
Problem Sets
Professor Michael Sipser teaching Lecture 14 of Theory of Computation. (Image by MIT OpenCourseWare.)
