* COS 487 / MAT 407 Graded A-F, P/D/F, Audit
Theory of Computation
Studies the limits of computation by identifing tasks that are either inherently impossible to compute, or impossible to compute within the resources available. Introduces students to computability and decidability, Godel's incompleteness theorem, computational complexity, NP-completeness and other notions of intractability.This course also surveys the status of the P versus NP question. Additional topics may include: interactive proofs, hardness of computing approximate solutions, cryptography, and quantum computation. Two lectures, one precept. Prerequisite: COS 340/341 or instructor's permission.
Sample reading list:
Michael Sipser, Theory of Computation
Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach
Problem set every week.
Take Home Mid term Exam - 15%
Take Home Final Exam - 35%
Problem set(s) - 50%
Prerequisites and Restrictions:
COS 340/341 or equivalent mathematical maturity..
|22616||L01||1:30 pm - 2:50 pm||M W||Computer Science Building 105||Enrolled:18 Limit:60|
|22933||P01||7:30 pm - 8:20 pm||M||Engineering Quad J-Wing J201||Enrolled:18 Limit:30|
|24315||P02||7:30 pm - 8:20 pm||T||Friend Center 112||Enrolled:0 Limit:30|