Approaches to effective computation: recursive functions, register machines, and Turing machines. Proof of their equivalence, discussion of Church's thesis. Elementary recursion theory. These techniques used to prove GÃ¶del's incompleteness theorem for arithmetic, whose technical and philosophical repercussions are surveyed. Prerequisite: 151. Class Notes: This course will be meeting only 9 a.m. to 10:20 a.m.