Provide a theoretical examination of computational complexity theory. Explain major complexity classes (P, NP, PSPACE, EXP), their relationships, and the significance of the P versus NP problem. Discuss different models of computation and how they affect complexity classification. Analyze techniques for proving lower bounds and reductions. Consider the philosophical implications of complexity results for understanding computation, problem-solving, and human cognition.