Define the fundamental complexity classes (P, NP, NP-complete, NP-hard, PSPACE, EXPTIME) and provide examples of problems belonging to each class. Discuss the P vs NP problem and its significance in computer science and mathematics. Explain the concept of reductions and their role in classifying problems. Describe techniques for proving lower bounds and discuss the implications of the Church-Turing thesis.