P vs NP Problem: Do P and NP Contain the Same Decision Problems?

Yes, this is a valid definition for the P vs NP problem. The question asks whether every problem that can be efficiently verified using an algorithm can also be efficiently solved using an algorithm. If the answer is yes, then P = NP, otherwise, P ≠ NP. This is one of the most important and unsolved problems in computer science and mathematics.