Computability Theory of and with Scheme
A graduate-level MIT OpenCourseWare course exploring programming theory, logic, and computability using the Scheme programming language. The curriculum treats Scheme evaluation as algebraic manipulation and term rewriting, then builds toward the undecidability of the Halting Problem for Scheme programs, properties of recursively enumerable sets, and Incompleteness Theorems for Scheme equivalences. Other topics include paradoxes arising from self-application, formal semantics for programs, logic for specification and verification, and Hilbert's Tenth Problem. Materials come from MIT's 6.844 course and include the full set of lecture notes and problem materials typical of OCW offerings, free to access under a Creative Commons license. No certificate is offered, consistent with MIT OpenCourseWare's model, but the complete graduate syllabus is available for self-study.