What can we compute--even with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theory. The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be self-contained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites.
"Sinopsis" puede pertenecer a otra edición de este libro.
Rebecca Weber, Dartmouth College, Hanover, NH, USA
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 17,45 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoEUR 11,86 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 203 pages. 8.50x5.50x0.50 inches. In Stock. Nº de ref. del artículo: __082187392X
Cantidad disponible: 1 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FW-9780821873922
Cantidad disponible: 15 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 203 pages. 8.50x5.50x0.50 inches. In Stock. Nº de ref. del artículo: 082187392X
Cantidad disponible: 1 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. New copy - Usually dispatched within 4 working days. 293. Nº de ref. del artículo: B9780821873922
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Condición: New. KlappentextrnrnWhat can we compute - even with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theor. Nº de ref. del artículo: 595068197
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 18946733-n
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 203. Nº de ref. del artículo: 58088106
Cantidad disponible: 3 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Neuware - What can we compute - even with unlimited resources Is everything within reach Or are computations necessarily drastically limited, not just in practice, but theoretically These questions are at the heart of computability theory. The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Nº de ref. del artículo: 9780821873922
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 18946733-n
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 203. Nº de ref. del artículo: 2650455925
Cantidad disponible: 3 disponibles