Computability Theory of and with Scheme
12 votes
Free
|
||
![]() |
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 from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem. Starts :
2003-02-01 |
|
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. |
Let us know when you did the course Computability Theory of and with Scheme.

Add the course Computability Theory of and with Scheme to My Personal Education Path.

Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.
