Explain the theoretical framework of computational complexity, focusing on the P vs NP problem. Discuss complexity classes (P, NP, NP-complete, PSPACE) and their relationships. Analyze the implications if P were equal to NP versus if they were different, and discuss real-world problems that fall into these categories.