Stock photo: cover may vary
Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science) Paperback - 2024
by Rod Downey
- Used
A$186.33
A$5.85
Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Standard delivery: 2 to 14 days
Ships from GreatBookPrices (Maryland, United States)
Details
- Title Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)
- Author Rod Downey
- Binding Paperback
- Condition New
- Pages 346
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2024-05-11
- Illustrated Yes
- Features Illustrated
- Bookseller's Inventory # 47457049
- ISBN 9783031537431 / 3031537432
- Weight 1.16 lbs (0.53 kg)
- Dimensions 9.21 x 6.14 x 0.78 in (23.39 x 15.60 x 1.98 cm)
- Category Computers - General Information
- Quantity available 5
About GreatBookPrices Maryland, United States
Biblio member since 2024
Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.
Reader reviews for Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
The ideas and techniques comprised in the mathematical framework for understanding computation should form part of the standard background of a graduate in mathematics or computer science, as the issues of computability and complexity permeate modern science.
This textbook/reference offers a straightforward and thorough grounding in the theory of computability and computational complexity. Among topics covered are basic naive set theory, regular languages and automata, models of computation, partial recursive functions, undecidability proofs, classical computability theory including the arithmetical hierarchy and the priority method, the basics of computational complexity and hierarchy theorems.
Topics and features:
- Explores Conway's undecidability proof of the ``3x+1'' problem using reductions from Register Machines and "Fractran"
- Offers an accessible account of the undecidability of the exponential version of Hilbert's 10th problem due to Jones and Matijacevič
- Provides basic material on computable structure, such as computable linear orderings
- Addresses parameterized complexity theory, including applications to algorithmic lower bounds and kernelization lower bounds
- Delivers a short account of generic-case complexity and of smoothed analysis
- Includes bonus material on structural complexity theory and priority arguments in computability theory
This comprehensive textbook will be ideal for advanced undergraduates or beginning graduates, preparing them well for more advanced studies or applications in science. Additionally, it could serve such needs for mathematicians or for scientists working in computational areas, such as biology.
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.
