Condition: New. 2024th edition NO-PA16APR2015-KAP.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Condition: New.
Seller: SMASS Sellers, IRVING, TX, U.S.A.
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New.
Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 76.92
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 72.54
Quantity: Over 20 available
Add to basketCondition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 84.57
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Revaluation Books, Exeter, United Kingdom
US$ 108.10
Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 374 pages. 9.26x6.11x9.21 inches. In Stock.
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question How can we show that none is possible How computationally hard is the question we are concerned with Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps Can we perform some algorithm with only a limited memory Does randomness help Are there standard approaches to overcoming computational difficulty.
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Computability and Complexity | Foundations and Tools for Pursuing Scientific Applications | Rod Downey | Taschenbuch | Undergraduate Topics in Computer Science | xxviii | Englisch | 2024 | Springer | EAN 9783031537431 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.