COMP 230 — Logic and Computability

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.

• Rating: 4.74 out of 5 from 439 student reviews
• Difficulty: 3.56 out of 5
• Credits: 3
• Faculty: Faculty of Science
• Department: Computer Science
• Taught by: Giulia Alberini
• Prerequisite: CEGEP level mathematics.

Sections offered

• Section 001 (Lec), Tue Thu 10:05-11:25 am — unknown seats open