COMP 230 Logic and Computability

3 credits · Computer Science · Faculty of Science · Offered: Winter

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.

Prerequisites

CEGEP level mathematics.

Courses that need COMP 230

COMP 302
LING 360

Plan your whole degree in myDegree. Fit COMP 230 and everything it needs into a plan, term by term. Open myDegree

Source: McGill Course Catalogue. myDegree is an independent student project, not affiliated with McGill University.