email: cbcafier (at) uvm.edu /UL>
Office Hours for GTF: M 3:30 to 4:30 Votey 351A
Introduction to the Theory of Computation by Michael Sipser (Third Edition)
Prerequisites: CS 124 and CS 125.
Assignments: 10 (there will between 3 and 5 assignments totalling 10 marks)
Make-up tests will be given only in the event of illness or
other genuine emergency.
All work handed in is expected to be that of the individual.
If you have any
questions regarding this, please see the instructor. For details of the University
policy on academic integrity, see the section on academic honesty in the student handbook.
The final exam is tentatively scheduled for
List of topics (approximate):
Reducibility and decidability, recursion theory, time and space
complexity, P, NP, NP-completeness, PSPACE, PSPACE-completeness, L and NL, advanced topics in computability and complexity.
If you are entitled to extra accommodation for any reason (such as a disability), we will make every reasonable attempt to accomodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.
You can find the class news and announcements in the following link.
News and Announcements here.