Explain the Church-Turing thesis and its significance in theoretical computer science. Compare different models of computation (Turing machines, lambda calculus, recursive functions) and demonstrate their equivalence. Discuss the concept of algorithmic decidability and provide examples of undecidable problems. Analyze the P vs. NP problem and its implications for computational limits.