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.

*"synopsis" may belong to another edition of this title.*

US$ 99.52

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
Springer-Verlag New York Inc., United States
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Springer-Verlag New York Inc., United States, 2012. Paperback. Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. 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. Softcover reprint of the original 1st ed. 1998. Seller Inventory # LIE9781461268734

Published by
Springer-Verlag New York Inc., United States
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Springer-Verlag New York Inc., United States, 2012. Paperback. Condition: New. Language: English. Brand new Book. 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. Softcover reprint of the original 1st ed. 1998. Seller Inventory # AAV9781461268734

Published by
Springer
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Springer, 2012. Paperback. Condition: NEW. 9781461268734 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0299979

Published by
Springer-Verlag New York Inc., United States
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Paperback
Quantity Available: 10

Seller:

Rating

**Book Description **Springer-Verlag New York Inc., United States, 2012. Paperback. Condition: New. Language: English. Brand new Book. 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. Softcover reprint of the original 1st ed. 1998. Seller Inventory # AAV9781461268734

Published by
Springer
(2016)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **Springer, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9781461268734_lsuk

Published by
Springer-Verlag New York Inc.
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Springer-Verlag New York Inc., 2012. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9781461268734

Published by
Springer-Verlag New York Inc.
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Springer-Verlag New York Inc., 2012. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9781461268734

Published by
Springer
(1997)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Softcover
Quantity Available: 15

Seller:

Rating

**Book Description **Springer, 1997. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # LP9781461268734

Published by
Springer
(2012)

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Softcover
Quantity Available: 1

Seller:

Rating

**Book Description **Springer, 2012. Condition: New. book. Seller Inventory # M1461268737

Published by
Springer

ISBN 10: 1461268737
ISBN 13: 9781461268734

New
Paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **Springer. Paperback. Condition: New. 453 pages. Dimensions: 9.1in. x 6.1in. x 1.2in.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 Newtons 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 developa 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9781461268734