Models of Computation: An Introduction to Computability Theory (Undergraduate Topics in Computer Science)

Fernandez, Maribel

ISBN 10: 1848824335 / ISBN 13: 9781848824331

Published by Springer, 2009

About this Item

CLEAN.

Seller Inventory # 000053

Bibliographic Details

• Title: Models of Computation: An Introduction to Computability Theory (Undergraduate Topics in Computer Science)
• Publisher: Springer
• Publication Date: 2009
• Language: English
• ISBN 10: 1848824335
• ISBN 13: 9781848824331
• Binding: Soft cover
• Condition: Good
• Dust Jacket Condition: No Jacket

About this title

Synopsis

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.

From the Back Cover

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.