Your cart is empty now.
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.
Author: Maribel Fernandez
Binding Type: Paperback
Publisher: Springer
Published: 04/21/2009
Series: Undergraduate Topics in Computer Science
Pages: 184
Weight: 0.75lbs
Size: 9.10h x 6.90w x 0.60d
ISBN: 9781848824331
2009 Edition
Review Citation(s):
Choice 11/01/2009
Ezra's Archive Does not ship outside of the United States
Delivery Options:
1. Economy:
Estimated Delivery Time - 5 to 8 Business Days
Shipping Cost - $4.15
2. USPS Priority:
Estimated Delivery Time - 1 to 3 Business Days
Shipping Cost - $8.85
3. Free Economy Shipping: Only Applicable to Orders over $60
Returns and Refunds:
Purchased items are not eligible to be returned. However, a refund or item replacement may be granted should an item be damaged or misplaced during shipping. To make a refund or replacement claim please contact us via email at Ezra'sArchive@outlook.com