Ï㽶ÊÓƵ

COMP 230 Logic and Computability (3 unités)

Offered by: Informatique (Sciences)

Vue d'ensemble

Informatique (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: This course is not scheduled for the 2024-2025 academic year.

Instructors: There are no professors associated with this course for the 2024-2025 academic year.

  • 3 hours

  • Prerequisite: CEGEP level mathematics.

Back to top