Define and explain the fundamental complexity classes P, NP, NP-complete, and NP-hard. Discuss the significance of the P vs NP problem in theoretical computer science and its implications for algorithm design. Provide a theoretical analysis of why NP-complete problems are considered computationally intractable, and discuss the concept of reduction and its role in establishing NP-completeness.