Question with a simple "yes" or "no" answer
Decision problem is decidable if there is an algorithm that can always find the correct answer in a finite amount of time for any given input.
Class P includes all decision problems that can be solved efficiently in polynomial time, whereas the class NP contains problems where a "yes" answer can be verified quickly in polynomial time.
The "P versus NP" question asks if every problem with a quickly verifiable solution can also be solved quickly. It's a fundamental question about whether "solving" is as easy as "checking."
You would be awarded a $1 million prize from the Clay Mathematics Institute.