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.
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.

Models of Computation: An Introduction to Computability Theory
184
Models of Computation: An Introduction to Computability Theory
184Product Details
ISBN-13: | 9781848824331 |
---|---|
Publisher: | Springer London |
Publication date: | 05/29/2009 |
Series: | Undergraduate Topics in Computer Science |
Edition description: | 2009 |
Pages: | 184 |
Product dimensions: | 7.00(w) x 9.20(h) x 0.50(d) |