everything.study
LPS 205C

Undecidability and Incompleteness

4 Units.

Formal theory of effective processes, including recursive function, Turing machines, Church's thesis, proofs of Goedel's incompleteness theorem for arithmetics, and Church's undecidability for first-order logic.

Prerequisites & course information

Formal theory of effective processes, including recursive function, Turing machines, Church's thesis, proofs of Goedel's incompleteness theorem for arithmetics, and Church's undecidability for first-order logic.

Sources