Introduction to Theory of Computation (COMP 3803)
Fall 2021

Instructor: Michiel Smid
Office: Herzberg Building 5125C
E-mail: michiel(@scs.carleton.ca)
Lectures:
Fall term:
Office hours:
Course objectives: Theoretical aspects of computer science.
Topics covered include: Formal languages and automata theory (regular languages, finite automata, context-free languages, pushdown automata), computability theory (Turing machines, Church-Turing Thesis, decidability, Halting Problem).
Textbook:
Important dates:
Grading scheme:
Assignments:
Midterm:
Final exam:
Academic Integrity (New, Please Read): As of 2020, there are new penalties in place for academic integrity violations. These will be issued by the Associate Dean (Undergraduate Affairs) of Science to students who copy, in whole or in part, work they submit for assignments. Note: While these are the standard penalties, more severe penalties may be applied when warranted. For more information, click here.
What was done in class:
Tentative schedule, based on the last time I taught this course.