What is a decision problem?

A problem that needs a finite decision or answer, yes or no. To solve the problem, math or formal logic are used and the processes should be finite.

What does it mean for a decision problem to be decidable?

Being decidable by an axiomatic method under a formal mathematical system. According to Gödel’s incompleteness theorem, some statements are incorporable under a formal given system, so axioms in other systems should be incorporated.

What is the class P? What is the class NP?

The class P refers to problems that are solvable in polynomial time. And class NP refers to problems that are verifiable in polynomial time.

What is the intuitive meaning of the “P versus NP” question?

Since P is solving and NP is checking, the intuitive meaning should be how to solve a checkable problem. To expand on this, solvability and known relationship between P problem and NP problem are intuitive. Every solvable problem is a subset of NP problem, but it is unknown if an NP problem is solvable.

If you resolve the P versus NP question, how much richer will you be?

earn $7million prize because NP problem can possibly disproove all the questions