Examine the theoretical limits of computation, including undecidable problems, the halting problem, and computational complexity classes. Discuss the Church-Turing thesis and its implications for artificial intelligence and human cognition. Analyze problems that are theoretically solvable but computationally intractable, and approaches to handling these limitations.