COMP 230 Logic and Computability (3 credits)

Offered by: Computer Science (Faculty of Science)

Overview

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.

Terms: Fall 2016

Instructors: Oran Magal (Fall)

  • 3 hours

  • Prerequisite: CEGEP level mathematics.