Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications

Downey, Rod

Paperback

Series: Undergraduate Topics in Computer Science

FictionGeneral Computers

ISBN10: 3031537432
ISBN13: 9783031537431
Publisher: Springer
Published: May 11 2024
Pages: 346
Weight: 1.16
Height: 0.78 Width: 6.14 Depth: 9.21
Language: English

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?

Also from

Downey, Rod

View All

Also in

General Computers

View All