I just came across this MIT OCW listing for a computability theory class from 2003 done in MIT Scheme, including lecture notes, code, and assignments:
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-844-computability-theory-of-and-with-scheme-spring-2003/
There are slightly more recent materials (from 2005) at:
https://courses.csail.mit.edu/6.844/spring05-6844/handouts/
Here's the course description:
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.
I'm afraid the subject is as yet over my head, but one day I hope to be able to tackle it. In the meantime, I'll be trying out the linked .edwin config.
neat!
Do we just do the assignments and post our solutions here? Or how would you study this, since there's no textbook or lectures?
>>3
The syllabus says there's no textbook and seems to suggest that the lecture notes are enough. I've no idea how well that works for self-study, however. After some DDGing around it looks like there are some computability theory lectures available on Youtube and a number of textbooks, although nothing tailored specifically for this course. This one at least is edited in part by the professor of 6.844:
http://hjemmesider.diku.dk/~neil/comp2book2007/book-whole.pdf
Worth mentioning that in addition to the intro CS class the syllabus also mentions their discrete math class as a prerequisite, and OCW does have the full video lectures for that (with slides in glorious Comic Sans):
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-spring-2015/
I have my solutions to Assignment #1, for problems 11, 12 and 13, as required. Do you want me to post it? Since there are official solutions linked for week 2, it might not be that interesting.
Assignment #2 seems impossible, it is making me feel so dumb I am close to crying.