Explore the foundational concepts of computability and formal models with ‘Computability and Models.’ This essential volume, part of the London Mathematical Society Lecture Notes series, delves into the theoretical underpinnings of computation. Perfect for students and researchers in computer science, mathematics, and logic, this 2003 publication from Springer offers a comprehensive treatment of Turing machines, recursive functions, and the limits of computation. Understand the fundamental principles that define what can and cannot be computed. Enhance your knowledge of theoretical computer science with this insightful and rigorously presented text. Ideal for anyone seeking a deep understanding of the core ideas in computability theory and formal systems.