Non-Fiction Books:

Computability and Complexity

Foundations and Tools for Pursuing Scientific Applications
Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$135.00
Releases

Pre-order to reserve stock from our first shipment. Your credit card will not be charged until your order is ready to ship.

Available for pre-order now
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $33.75 with Afterpay Learn more

6 weekly interest-free payments of $22.50 with Laybuy Learn more

Pre-order Price Guarantee

If you pre-order an item and the price drops before the release date, you'll pay the lowest price. This happens automatically when you pre-order and pay by credit card or pickup.

If paying by PayPal, Afterpay, Laybuy, Zip, Klarna, POLi, Online EFTPOS or internet banking, and the price drops after you have paid, you can ask for the difference to be refunded.

If Mighty Ape's price changes before release, you'll pay the lowest price.

Availability

This product will be released on

Delivering to:

It should arrive:

  • 30 May - 6 Jun using International Courier

Description

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?

Author Biography:

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.
Release date NZ
May 23rd, 2024
Author
Pages
346
Edition
1st ed. 2024
Audience
  • Undergraduate
Illustrations
17 Illustrations, black and white; Approx. 330 p.
ISBN-13
9783031537431
Product ID
38546148

Customer previews

Nobody has previewed this product yet. You could be the first!

Write a Preview

Help & options

Filed under...