Explain the P vs NP problem in computational complexity theory. Define complexity classes P and NP, and provide examples of problems in each class. Discuss the significance of this problem for computer science, mathematics, and philosophy. Analyze the implications if P equals NP or if P does not equal NP. Discuss approaches that have been taken to solve this problem and why it remains unresolved.