Theory of Computation

A man in front of a black screen with text and images.

Professor Michael Sipser teaching Lecture 14 of Theory of Computation. (Image by MIT OpenCourseWare.)


MIT Course Number

18.404J / 18.4041J / 6.840J

As Taught In

Fall 2020


Undergraduate / Graduate

Cite This Course

Course Description

Course Features

Educator Features

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.

Other Versions

Related Content

Michael Sipser. 18.404J Theory of Computation. Fall 2020. Massachusetts Institute of Technology: MIT OpenCourseWare, License: Creative Commons BY-NC-SA.

For more information about using these materials and the Creative Commons license, see our Terms of Use.