A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided.Divided into two parts, the first highlights the traditional computation models used in the first studies on computability: Automata and Turing Machines; Recursive functions and the Lambda-Calculus; Logic-based computation models. and the second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics. At the end of each chapter there is a discussion on the use of computation models in the design of programming languages. Provides an in-depth analysis of the basic concepts underlying the models of computation that underpin the most well-known families of programming languages INDICE: Introduction.- Part I Traditional Models of Computation.- Automataand Turing Machines.- The Lambda Calculus.- Recursive Functions.- Logic-BasedModels of Computation.- Part II Modern Models of Computation.- Computing withObjects.- Interaction-Based Models of Computation.- Concurrency.- Emergent Models of Computation.- Answers to Selected Exercises.- Bibliography.- Index.
- ISBN: 978-1-84882-433-1
- Editorial: Springer
- Encuadernacion: Rústica
- Páginas: 200
- Fecha Publicación: 01/04/2009
- Nº Volúmenes: 1
- Idioma: Inglés