LPS 105C
Undecidability and Incompleteness
Introduction to the formal theory of effective processes, including recursive functions, Turing machines, Church's thesis, and proofs of Göedel's incompleteness theorem for arithmetic, and Church's undecidability theorem for first-order logic.
Prerequisites & course information
Introduction to the formal theory of effective processes, including recursive functions, Turing machines, Church's thesis, and proofs of Göedel's incompleteness theorem for arithmetic, and Church's undecidability theorem for first-order logic.
Sources
- Course catalogue ↗2026-2027