Cantitate/Preț
Produs
Total produse
Vezi coșul
Models of Computation: An Introduction to Computability Theory de Maribel Fernandez

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

Autor Maribel Fernandez
en Limba Engleză Paperback – 21 apr 2009
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.
Citește tot Restrânge

Din seria Undergraduate Topics in Computer Science

Preț: 30089 lei

Preț vechi: 37611 lei
-20% Nou

Puncte Express: 451
Preț estimativ în valută:
5759€ • 5935$ • 4862£

Carte tipărită la comandă

Livrare economică 04-18 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781848824331
ISBN-10: 1848824335
Pagini: 196
Ilustrații: XI, 184 p.
Dimensiuni: 178 x 254 x 15 mm
Greutate: 0.34 kg
Ediția:2009
Editura: SPRINGER LONDON
Colecția Springer
Seria Undergraduate Topics in Computer Science

Locul publicării:London, United Kingdom

Public țintă

Lower undergraduate

Cuprins

Traditional Models of Computation.- Automata and Turing Machines.- The Lambda Calculus.- Recursive Functions.- Logic-Based Models of Computation.- Modern Models of Computation.- Computing with Objects.- Interaction-Based Models of Computation.- Concurrency.- Emergent Models of Computation.- Answers to Selected Exercises.

Recenzii

From the reviews:
"The focus of this relatively short book is on newer object-oriented and interaction-oriented models, including recent work in quantum computing and systems biology. … the book is designed for advanced undergraduate and graduate students. … Each chapter starts by clearly indicating what will be covered and ends with a series of exercises. … the book as a whole is extremely well written. Definitions are clearly stated … . Each model of computation is precisely defined, and the examples are clear and to the point." (K. Harrow, ACM Computing Reviews, September, 2009)
“It is a pleasure to see a book which takes a different approach to computer theory. … This short book can be used for a one-term course … . A valuable primer for students of programming languages. Summing Up: Highly recommended. Upper-division undergraduates and graduate students.” (P. Cull, Choice, Vol. 47 (3), November, 2009)

Textul de pe ultima copertă

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.

Caracteristici

Provides an in-depth analysis of the basic concepts underlying the models of computation that underpin the most well-known families of programming languages