6.045J | Spring 2011 | Undergraduate

Automata, Computability, and Complexity


Problem set 1: Number theory and regular languages (PDF)
Problem set 2: Context-free languages (PDF)
Problem set 3: The Gödel-Turing mindblower (PDF)
Problem set 4: Computability and complexity (PDF)
Problem set 5: NP-completeness and more (PDF)
Problem set 6: Randomness and cryptography (PDF)

Course Info

As Taught In
Spring 2011
Learning Resource Types
Problem Sets
Lecture Notes