Provide a comprehensive examination of theoretical limits in computation, including Turing machines, the Church-Turing thesis, undecidability, and computational complexity classes (P, NP, etc.). Explain the P vs NP problem and its significance. Explore theoretical models that extend standard computation, including quantum computing, hypercomputation, and analog computation. Discuss the physical constraints on computation and their relationship to fundamental limits in physics. Consider philosophical implications of these boundaries for human cognition and the nature of problem-solving.