menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Complexity and Real Computation (in English)
Type
Physical Book
Publisher
Language
Inglés
Pages
453
Format
Paperback
Dimensions
23.4 x 15.6 x 2.4 cm
Weight
0.66 kg.
ISBN13
9781461268734
Edition No.
1998th

Complexity and Real Computation (in English)

Felipe Cucker (Author) · Michael Shub (Author) · Lenore Blum (Author) · Springer · Paperback

Complexity and Real Computation (in English) - Blum, Lenore ; Cucker, Felipe ; Shub, Michael

Physical Book

$ 52.09

$ 54.99

You save: $ 2.90

5% discount
  • Condition: New
It will be shipped from our warehouse between Thursday, June 20 and Friday, June 21.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Complexity and Real Computation (in English)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews