Introduction to the theory of computability: Turing machines, Church's thesis, computable and non-computable functions, recursive and recursively enumerable sets, reducibility. Introduction to complexity theory: models of computation, P, NP, polynomial time reducibility, NP-completeness, further topics in complexity theory.
Instructor: Vincent Maccio
The final exam will be posted here later today (before 8:00pm). Read the instructions and questions carefully. You can ask questions via Piazza..
CANCELLED Mondays: 1:00-3:00, Thursdays 4:00-5:45 CANCELLED
Lectures have moved online. Find them on YouTube here.
Office hours will be cancelled until further notice..
I was able to get the LEC0101 lecture room changed. That is, the Monday lecture section from 11:00-1:00 will now be held in CC 1140. From the looks of it this will be a much better room.
The course syllabus can be found here. A quick note about assignment due dates. All assignment due dates on the syllabus are placeholders. The actual due date will depend on how fast we proceed through the material. I will always give you at least two weeks to complete an assignment, from the time it's posted until the due date.
This course uses Piazza as its discussion board, the course can be found here. Use this link to sign up/enroll, the access code is csc363h5s. A friendly reminder, you may post anonymously to your classmates, however, it is not anonymous to myself nor the TAs.