Job Description
If you have any issues applying, please contact Kelly Squier
-----------------------
Course Code and Title: CSCC63H3 - Computability and Computational Complexity
Course Description: 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. Note: Although the courses CSCC63H3 and CSCC73H3 may be taken in any order, it is recommended that CSCC73H3 be taken first.
Lecture Section: LEC01: TUE 12-2pm & THU 2-3pm
Course Enrollment (est.): 120
Number of Positions (est.): One
Qualifications: The successful candidate must demonstrate thorough, solid, and technical expertise in the topics explored during the course. These include compu...