ISBN: 9781848824331 - models of computation: an introduction to computability theory (27 résultats)

Paperback. Etat : Good. 2009th Edition. Ships same day or next business day! UPS shipping available (Priority Mail for AK/HI/APO/PO Boxes). Used sticker and some writing and/or highlighting. Used books may not include working access code or dust jacket.

Etat : good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

paperback. Etat : Good.

paperback. Etat : Very Good.

Soft cover. Etat : Good. No Jacket. CLEAN.

Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:9781848824331.

paperback. Etat : Fine.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Paperback. Etat : New. 2009 ed.

Etat : New. In English.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New. pp. xii + 184.

Paperback. Etat : Brand New. 1st edition. 184 pages. 9.21x7.01x0.55 inches. In Stock.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Etat : Neu. Models of Computation | An Introduction to Computability Theory | Maribel Fernandez | Taschenbuch | Undergraduate Topics in Computer Science | xi | Englisch | 2009 | Springer | EAN 9781848824331 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Paperback. Etat : New. 2009 ed. 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.…

PF. Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 200 pp. Englisch.…

Etat : New. Print on Demand pp. xii + 184 Illus.

Etat : New. PRINT ON DEMAND pp. xii + 184.

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides an in-depth analysis of the basic concepts underlying the models of computation that underpin the most well-known families of programming languagesProvides an in-depth analysis of the basic concepts underlying the models of computation that .…

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 200 pp. Englisch.…