Models of Computation - pr_210598

Models of Computation

An Introduction to Computability Theory

Paperback

$68.60

Or 4 payments of $17.15 with

delivery message Free delivery for orders over $49.99

Add to Wish List
Delivered in 10 - 14 days
Available for Click and Collect
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.

Product code: 9781848824331

ISBN 9781848824331
Dimensions H254xW178
Series Undergraduate Topics in Computer Science
Edition 2009 ed.
No. of pages 184
Publisher Springer London Ltd
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.