Vs Non-deterministic Polynomial Time. We want problems that can be solved in polynomial time because these are problems that we can actually reasonably solve.
P is the class of all search problems that can be solved in polynomial time. For a problem to be in P, then it must also be well-defined.