Picture 1 of 1

Stock photo

Complexity and Real Computation, Hardcover by Blum, Lenore (EDT); Cucker, Fel... - Picture 1 of 1

Complexity and Real Computation by Steve Smale, Felipe Cucker, Lenore Blum, Michael Shub (Hardcover, 1997)

superbookdeals (81642)

96.5% positive Feedback

Price:

£80.98

Free postage

Estimated delivery Fri, 13 Jun - Fri, 20 Jun

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

Complexity and Real Computation, Hardcover by Blum, Lenore (EDT); Cucker, Felipe; Shub, Michael; Smale, Steve, ISBN 0387982817, ISBN-13 9780387982816, Brand New, Free P&P in the UK This book develops a formal theory of computation which integrates major themes of the classical theory and which applies directly to problems in mathematics, numerical analysis, and scientific computing. Following an extensive introduction are proofs and extensions of relevant theorems. Along the way, the authors consider such fundamental questions as: Is the Mandelbrot set decidable? Is the Hilbert Nullstellensatz intractable? And, What is the real complexity of Newton's method?

About this product

Product Information

The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for theoretical computer science. The thesis of this book, however, is that it provides an inadequate foundation for modern scientific computation where most of the algorithms are real number algorithms. The goal of this book is to develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing. Along the way, the authors consider such fundamental problems as: * Is the Mandelbrot set decidable? * For simple quadratic maps, is the Julia set a halting set? * What is the real complexity of Newton's method? * Is there an algorithm for deciding the knapsack problem in a ploynomial number of steps? * Is the Hilbert Nullstellensatz intractable? * Is the problem of locating a real zero of a degree four polynomial intractable? * Is linear programming tractable over the reals? The book is divided into three parts: The first part provides an extensive introduction and then proves the fundamental NP-completeness theorems of Cook-Karp and their extensions to more general number fields as the real and complex numbers. The later parts of the book develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing.