What is a decision problem?
A decision problem is a problem where one must find the most effective way of obtaining "true" as an answer. These inputs vary widley from mainly natural numbers to binary strings or normal strings.
What does it mean for a decision problem to be decidable?
A question, or problem is said to be decidable if it one can always form a solution in the form of an algorithm for it
What is the class P? What is the class NP?
The class P consists of those problems that are solvable in polynomial time.
The class NP consists of those problems that are verifiable in polynomial time.
What is the intuitive meaning of the “P versus NP” question?
All problems in P can be solved with polynomial time algorithms, whereas all problems in NP - P are intractable. The problem belongs to class P if it’s easy to find a solution for the problem. The problem belongs to NP, if it’s easy to check a solution that may have been very tedious to find. So yeah quite a bit richer, but is it really worth decades worth of solving?
If you resolve the P versus NP question, how much richer will you be?
Being one of the 7 unsolved mathematical mysteries, according to Clay Mathematics Institute, one would recieve 1 million dollars on solving any one of the questions