Print Settings
 

PHIL 252: Computability and Logic (PHIL 152)

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.
Terms: Spr | Units: 4 | Grading: Letter or Credit/No Credit
Instructors: ; Sommer, R. (PI)
© Stanford University | Terms of Use | Copyright Complaints