Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 50,27
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. pp. 348.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 46,30
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. pp. 348.
Vendeur : Anybook.com, Lincoln, Royaume-Uni
EUR 40,35
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,650grams, ISBN:9783319278872.
Vendeur : Anybook.com, Lincoln, Royaume-Uni
EUR 40,35
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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,650grams, ISBN:9783319278872.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 45,83
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 348.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 90,86
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 348 pages. 9.00x6.00x0.50 inches. In Stock.
Langue: anglais
Edité par Springer, Springer International Publishing, 2016
ISBN 10 : 3319278878 ISBN 13 : 9783319278872
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 48,14
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative.Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included.'Limits of Computation' offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
EUR 42,22
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : new. Questo è un articolo print on demand.