PHIL 152: Computability and Logic (PHIL 252)
Approaches to effective computation: recursive functions, register machines, and programming styles. 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
| UG Reqs: GER:DB-Math
Instructors:
Ten Cate, B. (PI)
;
Steinert-Threlkeld, S. (TA)
Filter Results: