"Tempo-real (processamento de dados)" . . "Complessità di calcolo." . . "Algorithmes." . . "Algoritmos para processamento." . . "Temps real (Informàtica)" . . "Computer science." . . "Computer science" . "Berechenbarkeit Fraktal." . . "Information theory." . . "Logica simbolica." . . "Temps réel." . . "Temps réel (Informatique)" . . "Temps réel (informatique)" . "complexité de calcul (informatique) système en temps réel." . . "Algorismes per ordinador." . . "Komplexitätstheorie." . . "Algoritmi." . . "Mathematics." . . "Ciência da computação." . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "Complexity and real computation"@en . "Complexity and real computation" . . . . . . . . . . . . . . . . . . . . . . . . . . "Complexity and Real Computation" . "Complexity and Real Computation"@en . . . . . . . . . . . . . . . . . . "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."@en . . . . . . . . . "algorithme géométrique." . . "Complexitat de càlcul (Informàtica)" . . "Algoritmos." . . "Automatentheorie Komplexität." . . "Numerische Mathematik Komplexität." . . "Informàtica." . . "algorithme numérique." . . "Algoritmos Informática." . . "Algorismes computacionals." . . "théorie nombre." . . "Komplexität Automatentheorie." . . "Logic, Symbolic and mathematical." . . "Komplexität Numerische Mathematik." . . "Lógica matemática." . . "Complejidad de cálculo (Informática)" . . . . "Fraktal Berechenbarkeit." . . "Algoritmus." . . "Complexitat computacional." . . "Complexité de calcul (Informatique)" . . "Complexité de calcul (informatique)" . "complexité de calcul (informatique)" . "complexité calcul." . . "algorithmes complexité de calcul (informatique)" . . "Computational complexity." . . "Computational complexity" . "Komplexitás számítástechnika." . . "Proceso electrónico de datos en tiempo real." . . "Processament de dades en temps real." . . "Berechnungskomplexität" . . "Berechnungskomplexität." . "Real-time data processing." . . "Real-time data processing" . "Computer algorithms." . . "Computer algorithms" . "Informatique." . .