Skip to main content
Princeton Mobile homeCourses home

Theory of Computation

COS 487/MAT 407

Info tab content
Introduction to computability and complexity theory. Topics will include models of computation such as automata, and Turing machines; decidability and decidability; computational complexity; P, NP, and NP completeness; others.
Instructors tab content
Sections tab content

Section L01