| Models of Computation: An Introduction to Computability Theory 2009 Edition Contributor(s): Fernandez, Maribel (Author) |
|
 |
ISBN: 1848824335 ISBN-13: 9781848824331 Publisher: Springer OUR PRICE: $47.45 Product Type: Paperback - Other Formats Published: April 2009 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Computers | Software Development & Engineering - General - Computers | Programming Languages - General - Computers | Computer Science |
| Dewey: 511.3 |
| Series: Undergraduate Topics in Computer Science |
| Physical Information: 0.6" H x 6.9" W x 9.1" (0.75 lbs) 184 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |