A decision problem is a computational problem that requires a simple yes or no answer (or true/false) based on a specific set of inputs.
A decision problem is decidable if there exists an algorithm (or a Turing machine) that can always take any valid input, finish running in a finite number of steps, and correctly output a "yes" or "no" answer.
Class P contains decision problems that a computer can solve quickly in polynomial time, while class NP contains problems where a proposed solution can be verified quickly in polynomial time.
The intuitive meaning of the "P versus NP" question is whether every problem whose solution is easy to check is also easy to solve.
Resolving the P versus NP question earns you a $1 million prize from the Clay Mathematics Institute, plus potential untold billions through industry revolutions or breaking global encryption.
Decision Problems, Decidability, Verifiability, and Complexity Classes — Medium
P vs NP — YouTube
P vs NP Problem Explained — Cantor's Paradise