COMP 3602 -- Intro to the Theory of Computation, Winter 2026

Course information (tentative)

Lectures: 4:00pm -- 4:50pm Monday/Wednesday/Friday in EN-2007

Instructor: Antonina Kolokolova

Office: ER-6033

Instructor office hours: TBD or by appointment

Communication: We will use Brightspace course shell for course materials, discussions, and, most importantly, for the announcements. To get the announcements promptly (that is, in your email), please subscribe to notifications.

Email: kol@mun.ca.

Textbook: There will be no required textbook for this course; slides will be posted. 
That said, we will mostly follow Michael Sipser's "Intro to the theory of computation" (3rd edition preferred, 2nd OK).
For more advanced material we might use Sanjeev Arora and Boaz Barak "Computational complexity: a modern approach" and research papers. .

Marking scheme ( tentative! ):

Note that the last test and some presentations might be during the last week or two of the semester.

Missed work. If you cannot come to class on the day of a written test, email me as soon as possible (no later than 2 days after, if circumstances allow). If you miss one written test, your mark will be based on the other three; there will be no make-up tests. If you miss an oral exam, it can be taken as soon as you are well.

Prerequisites/background
This is one of the most abstract/conceptual courses in our curriculum. There will be no implementations, some pseudocode, and a lot of proofs. It will mostly build upon the material and skills from COMP 1002 (formulas, circuits, proofs), and the non-programming parts of COMP 1003 (finite automata, Turing machines and the Halting problem), as well as the basic knowledge of algorithms and data structures at the extent of COMP 2002 . Overall, expect to spend more time thinking and less time writing.

Tentative course description
What is an algorithm? What does it mean for a problem to be computationally easy, hard or unsolvable? What can be solved by a computer with only small finite memory or by circuits of a limited size? This course is about what is known and what is open about the power of computation, and its connections to areas from logic (including Gödel's incompleteness theorems) to cryptography. Time permitting, we may touch upon more advanced topics such as complexity of learning, Kolmogorov complexity, communication complexity, and/or quantum computing.

Lecture slides



Course Policies:

Academic Misconduct:

Students are expected to adhere to those principles which constitute proper academic conduct. A student has the responsibility to know which actions, as described under Academic Offences in the University Regulations, could be construed as dishonest or improper. Students found guilty of an academic offence may be subject to a number of penalties commensurate with the offence including reprimand, reduction of grade, probation, suspension or expulsion from the University. For more information regarding this policy, students should refer to the University Regulations for Academic Misconduct (Section 6.12) in the University Calendar, revisit the INTG 1000 course in Brightspace, or see the undergraduate page about academic integrity.

Academic misconduct for this course includes (but is not limited to) the following:

Academic Accommodations:

Memorial University of Newfoundland is committed to fostering equitable and accessible learning environments for all students. Accommodations for students with disabilities are provided in accordance with the Accommodations for Students with Disabilities Policy (www.mun.ca/policy/site/policy.php?id=534) and its related procedures. Students who feel that they may require formal academic accommodations to address barriers or challenges they are experiencing related to their learning are encouraged to contact Accessibility Services (the Blundon Centre, www.mun.ca/blundon) at the earliest opportunity to ensure any required academic accommodations are provided in a timely manner. You can contact Accessibility Services (Blundon Centre) by emailing blundon@mun.ca. Students using Blundon services for tests and the final exam are strongly recommended to contact the Blundon Centre at least 3 weeks ahead of the test/exam date to allow for arrangements to be made. Students who are registered with the Blundon Centre are also encouraged to contact the course instructor to discuss accommodations.

Copyright:

All material (lectures, practice problems, labs, tests, exams) delivered or provided by Dr. Antonina Kolokolova, including any visual or audio recording thereof, are subject to copyright. It is prohibited to record or copy by any means, in any format, openly or surreptitiously, in whole or in part, in the absence of express written permission from Dr. Antonina Kolokolova any of the lectures, materials provided or published in any form during or from the course. This includes posting any course content online.

Student support for the course:

Additional supports:

All students should be aware of the supports that Memorial University offers, which include: