Computability Theory of and with Scheme
Free, no sign-up neededSpring 2003English
About this course
6.844 is a graduate introduction to programming theory, logic of programming, and computability, with the programming language Scheme used to crystallize computability constructions and as an object of study itself. Topics covered include: programming and computability theory based on a term-rewriting, “substitution” model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes…
Description from MIT OpenCourseWare.
Where to take this course
- Open MIT OpenCourseWare (new tab)MIT OpenCourseWare · Spring 2003