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.)

Instructor(s)

MIT Course Number

18.404J / 18.4041J / 6.840J

As Taught In

Fall 2020

Level

Undergraduate / Graduate

Cite This Course

Need help getting started? Don't show me this again

Don't show me this again

Welcome!

This is one of over 2,400 courses on OCW. Explore materials for this course in the pages linked along the left.

MIT OpenCourseWare is a free & open publication of material from thousands of MIT courses, covering the entire MIT curriculum.

No enrollment or registration. Freely browse and use OCW materials at your own pace. There's no signup, and no start or end dates.

Knowledge is your reward. Use OCW to guide your own life-long learning, or to teach others. We don't offer credit or certification for using OCW.

Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse (just remember to cite OCW as the source.)

Learn more at Get Started with MIT OpenCourseWare

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, https://ocw.mit.edu. License: Creative Commons BY-NC-SA.


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


Close