Author: Lenore Blum
Edition: 1997
Binding: Hardcover
ISBN: 0387982817
Publisher: Springer
Features:
Edition: 1997
Binding: Hardcover
ISBN: 0387982817
Publisher: Springer
Features:
Complexity and Real Computation
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. Search and download computer ebooks Complexity and Real Computation for free.
Complexity and Real Computation, ISBN-13: 9780387982816, ISBN-10: 0387982817. Download Complexity and Real Computation computer ebooks
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?
Complexity and Real Computation
Complexity and Real Computation - Blum L., Cucker F., Shub M., Smale S.
Store Search search Title, ISBN and Author Complexity and Real Computation by Lenore Blum, S. Smale Estimated delivery 3-12 business days Format Hardcover Condition Brand New All those interested in questions of complexity and decidability will be interested in this groundbreaking book which extends the classical theory of computation to real numbers. The book develops a formal theory of computation which integrates major themes of the classical theory to be more directly applicable to real pro
Springer 9780387982816 Complexity and Real Computation (1997 Edition) Description All those interested in questions of complexity and decidability will be interested in this groundbreaking book which extends the classical theory of computation to real numbers. The book develops a formal theory of computation which integrates major themes of the classical theory to be more directly applicable to real problems in mathematics, numerical analysis, and scientific computing. *Author: Blum, Lenore/ Sm
author felipe cucker author lenore blum author michael shub author steve smale format mixed media product language english publication year 01 11 1997 subject computing it subject 2 computing general title complexity and real computation author blum lenore editor cucker felipe shub michael smale steve blum lenore publisher springer verlag publication date dec 01 1997 pages 453 binding hardcover edition 1 st dimensions 6 50 wx 9 75 hx 1 25 d isbn 0387982817 subject computers computer science de
Complexity and Real Computation Free
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
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?
