Theoretically discuss the P vs NP problem in computer science. Clearly distinguish between problems solvable in polynomial time (P) and problems verifiable in polynomial time (NP), and explain the implications if P were to equal NP.