• What is a decision problem? According to Wikipedia, in computability theory and computational complexity theory, a decision problem is a yes-no question, in which the answer is obtained from the input values, and it can only be answered with “yes” or “no. • What does it mean for a decision problem to be decidable? A decision problem is decidable if the set of inputs for which the answer is yes is a recursive set, which means we can always construct an algorithm that can solve the problem correctly. An example of a decidable problem is to output the prime numbers between 1000 and 2000. Sources: Wikipedia, GeeksForGeeks • What is the class P? What is the class NP? A P problem is a problem that can be solved in polynomial time, which means that an algorithm exists for its solution such that the total number of steps is a polynomial function of n, where n is the input. A problem is called NP if its solution can be guessed and verified in polynomial time, and nondeterministic means that no rule is followed to make the guess. • What is the intuitive meaning of the “P versus NP” question? One of the greatest question in theoretical computer science, the P versus NP questions refers to whether problems that can be verified in polynomial time can also be solved in polynomial time. • If you resolve the P versus NP question, how much richer will you be? $1 million USD