Note: This is the 2010鈥�2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click聽here to jump to the newest eCalendar.
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 2010
Instructors: Schlimm, Dirk (Fall)
- 3 hours
- Prerequisite: CEGEP level mathematics.