Name: Complexity and Real Computation (en Inglés)
Price: 273593.00 COP
Availability: InStock
Author: Blum, Lenore ; Cucker, Felipe ; Shub, Michael
ISBN: 9781461268734

portada Complexity and Real Computation (en Inglés)

Formato

Libro Físico

Autor

Editorial

Idioma

Inglés

N° páginas

453

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 15.6 x 2.4 cm

Peso

0.66 kg.

ISBN13

9781461268734

N° edición

1998th

Categorías

Lógica matemática
Matemáticas aplicadas
Ciencias de la computación

Complexity and Real Computation (en Inglés)

Felipe Cucker (Autor) · Michael Shub (Autor) · Lenore Blum (Autor) · Springer · Tapa Blanda

Libro Nuevo

$ 273.593

$ 455.988

Ahorras: $ 182.395

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Lunes 15 de Julio y el Lunes 29 de Julio.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Complexity and Real Computation (en Inglés)"

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.