6.844 | Spring 2003 | Graduate

Computability Theory of and with Scheme


Notes 1: Proving Arithmetic Equations (PDF)
Notes 2: Substitution into Arithmetic Expressions (PDF)
Notes 3: A Scheme Substitution Model (PDF)
Notes 4: Term Models (PDF)
Notes 5: Scheme Computability, Part I (PDF)
Notes 6: Scheme Computability, Part II (PDF)
Notes 7: Counter Machines (PDF)
Notes 8: Semigroup Word Problems (PDF)
Notes 9: 1st-order Theory of Concatenation (PDF)

Course Info

As Taught In
Spring 2003