The P versus NP problem is a major unsolved problem in mathematics and computer science. Informally, it posits whether every problem with a solution which can be quickly verified by a computer can also be quickly solved by a computer. In other words, just because a computer can verify a solution is correct, can that same computer also come up with a solution on it's own? It was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures" and is considered by most mathematicians and computer scientists to be the pre-eminent open problem in the mathematics. As the characters suggest, it is actually one of the seven Millennium Prize Problems offered by Clay Mathematics Institute to carry a US $1,000,000 prize for the first correct solution.