Explore the Church-Turing thesis and its implications for the theoretical foundations of computation. Discuss the relationship between formal systems, algorithms, and computability. Analyze theoretical limits of computation including undecidability, uncomputable functions, and computational complexity classes. How do these theoretical boundaries impact practical computing and artificial intelligence?