MIT Course 6.044J/18.423J
Computability, Logic, and Programming
All handouts are provided in PostScript format and LaTeX source. The
LaTeX sources may be useful for text searches, but cannot actually be run
through LaTeX at other locations, because, in addition to the custom macro
files in inputs, they call a web of LaTeX
.sty and font files found only on the LCS Theory of Computation machines.
We're working on improving this situation.
- Handout 1: Course Information,
LaTeX source
- Handout 2: A Rewriting
Model for Scheme, I. The Functional Kernel (revised^4 31 October, 1996)
LaTeX source
- Programs for the Scheme
Rewriting Interpreter
- Handout 3: Notes on Proving
Arithmetic Equations,
LaTeX source
- Handout 4: Problem Set 1,
LaTeX source
-
Scheme program yielding sum-of-monomials polynomial expressions
-
C++ program yielding sum-of-monomials polynomial expressions
- Handout 5: Problem Set 2,
LaTeX source
- Handout 6: Solutions, Problem Set 1,
LaTeX source
- Handout 7: Problem Set 3,
LaTeX source
- Handout 8: Solutions, Problem Set 2,
LaTeX source
- Handout 9: Solutions, Problem Set 3,
LaTeX source
- Handout 10: Quiz 1,
LaTeX source
- Handout 11: Quiz 1 Solutions,
LaTeX source
- Handout 12:
Quiz 1 Sorted Grades
- Handout 13: Problem Set 4,
LaTeX source
- Handout 14: Rewriting
Model for Scheme, II. Side-effects
LaTeX source
- Handout 15: Scheme Computability,
LaTeX source
- Handout 16: Problem Set 5,
LaTeX source
- Handout 17: Scheme
Computability, II.,
LaTeX source
- Handout 18: Problem Set 6,
LaTeX source
- Handout 19: Quiz 2,
LaTeX source
- Handout 20: Quiz 2 Solutions,
LaTeX source
- Handout 21:
Quiz 2 Sorted Grades
- Handout 22:
Lecture Outline
- Handout 23:
Problem Set 5 Solutions
- Handout 24:
Notes on the Semigroup Word Problem
- Handout 25:
Compiling Scheme to Nano-Computers
- Handout 26:
Turing reducibility and Relativization
- Handout 27: Final Exam,
LaTeX source
- Handout 28:
Sorted Final Grades