Calendar · Lecture Notes
MIT OpenCourseWare
Great Ideas in Theoretical Computer Science
Art: not stated, Fletcher's Combined Block Telegraph Apparatus and Bell, 1889 · Public domain
- Instructor
- Prof. Scott Aaronson
- Term
- Spring 2008
- Level
- Undergraduate
- What's inside
- 5 problem sets · 1 lecture note · 23 other files · 3 web pages
- Materials open
- MIT OCW
About this course
Source: MIT OpenCourseWare 6.080 Great Ideas in Theoretical Computer Science, Spring 2008, Prof. Scott Aaronson — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.
Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.
Before you start
Prerequisites are not listed here. Check MIT's own syllabus for this course.
How this course was organized
What's here, and what isn't
- MIT's own materials here did not support a verified, course-wide order, so they are grouped by section instead.
Not included here
2 items from the source could not be safely included:
- MIT's page format for this item wasn't recognized clearly enough to place it safely. (2 items)
Materials by section
Grouped by section, as MIT organized them. Not sequenced or ordered.
Lecture Notes
23 files
- Introduction to Computational Complexity Download
- Lecture 1 Download
- Lecture 2 Download
- Lecture 3 Download
- Lecture 4 Download
- Lecture 5 Download
- Lecture 6 Download
- Lecture 8 Download
- Lecture 9 Download
- Lecture 10 Download
- Lecture 11 Download
- Lecture 12 Download
- Lecture 13 Download
- Lecture 14 Download
- Lecture 15 Download
- Lecture 16 Download
- Lecture 17 Download
- Lecture 18 Download
- Lecture 19 Download
- Lecture 20 Download
- Lecture 21 Download
- Lecture 22/23 Download
- Lecture 24 Download
Assignments
Course outline
Calendar · Lecture Notes
Lecture 2: Logic
Calendar · Lecture Notes
Lecture 3: Circuits and finite automata
Calendar · Lecture Notes
Lecture 4: Turing machines
Calendar · Lecture Notes
Lecture 5: Reducibility and Gödel
Calendar · Lecture Notes
Lecture 6: Minds and machines
Calendar · Lecture Notes
Lecture 7: Complexity
Calendar · Lecture Notes
Lecture 8: Polynomial time
Calendar · Lecture Notes
Lecture 9: P and NP
Calendar · Lecture Notes
Lecture 10: NP-completeness
Calendar · Lecture Notes
Lecture 11: NP-completeness in practice
Calendar · Lecture Notes
Lecture 12: Space complexity and more
Calendar · Lecture Notes
Lecture 13: Randomness
Calendar · Lecture Notes
Lecture 14: Probabilistic complexity classes
Calendar · Lecture Notes
Lecture 15: Derandomization / cryptography double feature
Calendar · Lecture Notes
Lecture 16: Private-key cryptography
Calendar · Lecture Notes
Lecture 17: Public-key cryptography
Calendar · Lecture Notes
Lecture 18: Cryptographic protocols
Calendar · Lecture Notes
Lecture 19: Interactive proofs / machine learning
Calendar · Lecture Notes
Lecture 20: Probably Approximately Correct (PAC) learning
Calendar · Lecture Notes
Lecture 21: Learning, Chomsky, RSA, quantum
Calendar · Lecture Notes
Lecture 24: Quantum algorithms
MIT OpenCourseWare, Prof. Scott Aaronson, 6.080 Great Ideas in Theoretical Computer Science, Spring 2008.
License: CC BY-NC-SA 4.0 · Edition: Spring 2008 · Open the original course on OCW ↗
Organized by RedLectern, independent of MIT and not endorsed by MIT.
Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.
