Lectures on the Philosophy of Mathematics

by Joel David Hamkins

The class of nondeterministically polynomial-time decidable problems, it turns out, is identical to the class of polynomial-time verifiable problems, and this is the class known as NP.