| Course: | LPS/Phil 105C/205C |
| Name: | Undecidability and Incompleteness |
| Description: | Introduction to the formal theory of effective processes, including recursive functions, Turing machines, Church's thesis, and proofs of Gödel's incompleteness theorem for arithmetic, and Church's undecidability theorem for first-order logic. Prerequisite: 105B or consent of instructor. LPS 105C and Mathematics 152 cannot both be taken for credit. |