Complexity and Real Computation is a book on the computational complexity theory of real computation. It studies algorithms whose inputs and outputs are real numbers, using the Blum–Shub–Smale machine as its model of computation. For instance, this theory is capable of addressing a question posed in 1991 by Roger Penrose in The Emperor's New Mind: "is the Mandelbrot set computable?"[1]
The book was written by Lenore Blum, Felipe Cucker, Michael Shub and Stephen Smale, with a foreword by Richard M. Karp, and published by Springer-Verlag in 1998 (doi:10.1007/978-1-4612-0701-6, ISBN 0-387-98281-7).[2]
^Cite error: The named reference mcnicholl was invoked but never defined (see the help page).
^Cite error: The named reference meer was invoked but never defined (see the help page).
and 26 Related for: Complexity and Real Computation information
computationalcomplexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation...
computability theory, the theory of realcomputation deals with hypothetical computing machines using infinite-precision real numbers. They are given this name...
science and mathematics, computationalcomplexity theory focuses on classifying computational problems according to their resource usage, and relating...
In computationalcomplexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly...
In computer science, and more specifically in computability theory andcomputationalcomplexity theory, a model of computation is a model which describes...
the time complexity is the computationalcomplexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly...
three major branches: automata theory and formal languages, computability theory, andcomputationalcomplexity theory, which are linked by the question:...
problems in computer science) In theoretical computer science, the computationalcomplexity of matrix multiplication dictates how quickly the operation of...
mathematician and theoretical computer scientist who has done research into the complexity theory of the Blum–Shub–Smale computational model and the complexity of...
April 2018. Aaronson, Scott; Arkhipov, Alex (6 June 2011). "The computationalcomplexity of linear optics". Proceedings of the forty-third annual ACM symposium...
In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness of...
S2CID 6749770. Lenore Blum, Felipe Cucker, Michael Shub, and Stephen Smale (1998). ComplexityandRealComputation. Springer. ISBN 978-0-387-98281-6.{{cite book}}:...
In computationalcomplexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal...
computing with a history stretching back to antiquity. Computationalcomplexity is central to computational geometry, with great practical significance if algorithms...
and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development...
algorithms/computational methods to use when solving chemical problems.This section focuses on the scaling of computationalcomplexity with molecule size and details...
science, the analysis of algorithms is the process of finding the computationalcomplexity of algorithms—the amount of time, storage, or other resources needed...
In computationalcomplexity theory, DTIME (or TIME) is the computational resource of computation time for a deterministic Turing machine. It represents...
list of computability andcomplexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can...
number of real multiplications and additions, sometimes called the "arithmetic complexity" (although in this context it is the exact count and not the asymptotic...
Steve (1989), "On a theory of computationandcomplexity over the real numbers: NP-completeness, recursive functions and universal machines", Bulletin...
an important factor of complexity. In several scientific fields, "complexity" has a precise meaning: In computationalcomplexity theory, the amounts of...
sociology, social complexity is a conceptual framework used in the analysis of society. In the sciences, contemporary definitions of complexity are found in...
Global Information