Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications
Rod Downey
ISBN 10: 3031537432 ISBN 13: 9783031537431
Editore: Springer, 2024
Nuovi
Paperback
Da
UK BOOKS STORE, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 11 marzo 2024
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
Brand New ! Fast Delivery "International Edition " and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability. Codice articolo At 9783031537431
Riassunto:
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?
Informazioni sull?autore:
Rodney Downey is an Emeritus Professor at Victoria University of Wellington, NZ. He is the co-author of the Springer books, Fundamentals of Parameterized Complexity, and Algorithmic Randomness and Complexity. He has won many prizes for his work, including (twice) the Shoenfield Prize for writing, as well as the Rutherford Medal, New Zealand’s premier science award.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Computability and Complexity: Foundations ...
Casa editrice: Springer
Data di pubblicazione: 2024
Legatura: Paperback
Condizione: New
Edizione: Edizione Internazionale