Models of computation: An introduction to computability theory

Dr Maribel Fernández (auth.)1848824335, 9781848824331, 9781848824348, 1848824343

An Introduction to Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from Turing machines to the modern computation models inspired by quantum physics. It is addressed to advanced undergraduate students, as a complement to programming courses, or to postgraduate students interested in foundations of computation and the theory of computability.

There are two parts in the book. The first highlights the traditional models of computation used in the first studies on computability:

– Automata and Turing Machines;

– Recursive functions and the Lambda-Calculus;

– Logic-based computation models.

The second part covers object-oriented and interaction-based models, and includes a chapter on concurrency and a chapter on emergent models of computation inspired by quantum mechanics and systems biology.

At the end of each chapter there is a list of exercises, solutions to selected exercises are provided in the final chapter of the book. The book gives an in-depth analysis of the basic concepts underlying each model of computation. It privileges the understanding of the basic techniques and their relationships over simply describing their properties.

Table of contents :
Front Matter….Pages I-XI
Front Matter….Pages 1-1
Introduction….Pages 1-7
Front Matter….Pages 9-9
Automata and Turing Machines….Pages 11-32
The Lambda Calculus….Pages 33-53
Recursive Functions….Pages 55-68
Logic-Based Models of Computation….Pages 69-89
Front Matter….Pages 91-91
Computing with Objects….Pages 93-105
Interaction-Based Models of Computation….Pages 107-130
Concurrency….Pages 131-149
Emergent Models of Computation….Pages 151-157
Answers to Selected Exercises….Pages 159-178
Back Matter….Pages 179-184