CSC 363

Information

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.

Course Outline

Instructor: Vincent Maccio

Annoucements

Exam Office Hours: April 12 and 14, from 3:00 to 5:00

The Miterm will be held in IB 120.

The password to the Piazza page is: csc363h5s

Office hours are Monday/Thursday 1:00-2:30, DH 3015

The Midterm will be held on Thursday March 1st from 6:00-8:00 pm. If you have a conflict with this date email me as soon as possible.