Spring 2025 - CMPT 409 D100

Special Topics in Theoretical Computing Science (3)

Class Number: 5453

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 6 – Apr 9, 2025: Mon, Wed, Fri, 1:30–2:20 p.m.
    Burnaby

  • Prerequisites:

    CMPT 307 with a minimum grade of C-.

Description

CALENDAR DESCRIPTION:

Current topics in theoretical computing science depending on faculty and student interest.

COURSE DETAILS:

Modern logic grew out of efforts to provide a formal foundation for mathematics in the early 20th century, at the centre of which are fundamental results by Godel, Turing, and other luminary figures, establishing close ties between logic and computation. Logic has turned out to be a powerful tool in computer science.  In fact, most working logicians today are computer scientists. This course will provide an introduction to basic results in logic and computability, including Godel's Incompleteness theorems.

Note: This course is cross-listed with CMPT 701

COURSE-LEVEL EDUCATIONAL GOALS:

  • Propositional Logic
  • First-Order Logic
  • Proof Systems
  • Computability Theory
  • Recursive and Recursively Enumerable Sets
  • Goedel's Incompleteness Theorems

Grading

NOTES:

To be determined in the first week of classes. Students must attain an overall passing grade on the weighted average of exams in the course in order to obtain a clear pass (C- or better).

Materials

MATERIALS + SUPPLIES:

  • Computability and Logic - Course Notes, provided by the instructor, Stephen A. Cook, 0000000000000, These notes will be available from the course web page.
  • A Mathematical Introduction to Logic, 2nd Edition., Herbert B. Enderton, Elsevier, 2001, 9780122384523
  • Introduction to the Theory of Computation, Michael Sipser, Cengage, 2012, 9781133187790

REQUIRED READING:

  • Computability and Logic - Course Notes, provided by the instructor, Stephen A. Cook, 0000000000000, These notes will be available from the course web page.

RECOMMENDED READING:

  • A Mathematical Introduction to Logic, 2nd Edition., Herbert B. Enderton, Elsevier, 2001, 9780122384523
  • Introduction to the Theory of Computation, Michael Sipser, Cengage, 2012, 9781133187790

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

SFU’s Academic Integrity website http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the university community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the university. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the university. http://www.sfu.ca/policies/gazette/student/s10-01.html

RELIGIOUS ACCOMMODATION

Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.