COMP 230
3 credits
Logic and Computability

Computer Science (Sci): Propositional Logic, predicate calculus, proof systems, computability Turing machines, Church-Turing thesis, unsolvable problems, completeness, incompleteness, Tarski semantics, uses and misuses of Gödel's theorem.

Offered by: Computer Science