Explain the P vs NP problem in computer science theory. Define what P and NP complexity classes represent, provide examples of problems in each class, and discuss the implications if P were to equal NP or not. Outline key approaches researchers have taken to attempt to resolve this fundamental question.