what is a decision problem? a decision problem is one where there is only two possible outputs, either yes or no. while its definition is simple, there are a lot of the examples of such problems, like does a path exist between node 1 and 2 or is there a number that satisfies some requirement

what does it mean for a problem to be decidable? a decision problem is decideable if there is an algorithm that can correctly gives us the answer for every possible input.

what is the P and NP? P is the type of problems with a solution that can find the answer in polynomial time complexity. In NP problems, however, we can only check if the a given answer is correct in polynomial time. to learn more about the time complexity of algorithms, check out this lecture

what is P vs NP? it is simply the question that if we can check the correctness of answer to a problem, can we also find it quickly. in P = NP problems, yes, if you can check the solution, then you can also find it fast. N != NP means we can check the question but we can not find it. there is this great article on it, check it out if you are more of a visiual person, check out this YT video

how much richer will you be if you solve P vs NP very rich, at the very least, you are going to get the 1 million reward from the Clay Mathematics Institute's Millennium Prize Problems.