4.0%OFF
Download App
| >> | LShop | >> | Book | >> | Computing & Informat... | >> | Computer Programming... | >> | Complexity And Real ... |
4.0%OFF
Complexity and Real Computation
-
ISBN
:
9780387982816
-
Publisher
:
Springer
-
Subject
:
Computer Programming / Software Development, Computer Science, Mathematics
-
Binding
:
HARDCOVER
-
Pages
:
453
-
Year
:
1997
₹
9298.0
4.0% OFF
₹
8926.0
8926.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View Details(Imported Edition) Estimated Shipping Time : 25-28 Business Days
View Details
-
Description
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 algorithmsare 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.xA0;The later parts of the book developxA0;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.
Related Items
-
of
-
OFFER
JFLAP: An Interactive Formal Languages and Automata Package
Susan H. Rodger
Starts At
5823.0
7190.0
19% OFF
-
OFFER
Formal Semantics and Pragmatics for Natural Language Querying (Cambridge Tracts in Theoretical Computer Science)
James Clifford
Starts At
3679.0
4841.0
24% OFF
-
OFFER
Logic and Computation: Interactive Proof with Cambridge LCF (Cambridge Tracts in Theoretical Computer Science)
Lawrence C. Paulson
Starts At
7277.0
9576.0
24% OFF
-
OFFER
Applications of Process Algebra (Cambridge Tracts in Theoretical Computer Science)
J. C. M. Baeten
Starts At
5947.0
6916.0
14% OFF
-
OFFER
Default Reasoning: Causal and Conditional Theories (ACM Doctoral Dissertation Award)
Hector Geffner
Starts At
6749.0
7848.0
14% OFF
-
OFFER
Qualitative Reasoning: Modeling and Simulation with Incomplete Knowledge (Artificial Intelligence)
Benjamin Kuipers
Starts At
5502.0
6398.0
14% OFF
-
OFFER
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Weixiong Zhang
Starts At
12201.0
12710.0
4% OFF
-
OFFER
Elements of Real Analysis (International Series in Mathematics)
Charles G. Denlinger
Starts At
3674.0
5033.0
27% OFF
-
OFFER
Embedded / Real-Time Systems: Concepts, Design & Programming Black Book (With CD)
K. V. K Prasad
Starts At
580.0
699.0
17% OFF
-
OFFER
Logic and Information Flow (Foundations of Computing)
Jan van van Eijck
Starts At
3667.0
4265.0
14% OFF
-
OFFER
Automated Deduction in Nonclassical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics (Artificial Intelligence)
Lincoln A. Wallen
Starts At
3301.0
3839.0
14% OFF
