Define the complexity classes P and NP clearly with examples. Explain the significance of the P vs NP problem, including why many computer scientists believe P ≠ NP. Discuss known relationships between complexity classes and major results in complexity theory. Consider practical implications if P = NP, including impacts on cryptography, optimization problems, and artificial intelligence.