The P versus NP problem is an unsolved problem in computer science which asks whether every problem whose solution can be quickly verified can also be quickly solved. It has been called the most important open problem in computer science and carries a $1,000,000 prize for the first correct solution. If it turns out that P ≠ NP, it would mean that there are problems in NP that are harder to compute than to verify.

A course offering rigorous study of computation, examining the central results and questions about the nature of computation, including finite automata, computational complexity, and cryptography.