Published on *Computer Science Department at Princeton University* (http://www.cs.princeton.edu)

Introduction to computability and complexity theory. Topics will include models of computation such as finite automata, pushdown automata, and Turing machines; decidability and decidability; computational complexity; P, NP, and NP completeness; others.

Semester:
Fall16

Lectures:
Monday,Wednesday, 1:30-2:50

Location:
Computer Science 105

Robert Tarjan

Office:
Computer Science 324

Extension:
4797

Email:
ret

The Undergraduate Coordinator is Colleen Kenny

Email:
ckenny

Office:
Computer Science 210

Extension:
1746