Real computation
From Wikipedia - Reading time: 4 min
In computability theory, the theory of real computation deals with hypothetical computing machines using infinite-precision real numbers. They are given this name because they operate on the set of real numbers. Within this theory, it is possible to prove interesting statements such as "The complement of the Mandelbrot set is only partially decidable."
These hypothetical computing machines can be viewed as idealised analog computers which operate on real numbers, whereas digital computers are limited to computable numbers. They may be further subdivided into differential and algebraic models (digital computers, in this context, should be thought of as topological, at least insofar as their operation on computable reals is concerned[1]). Depending on the model chosen, this may enable real computers to solve problems that are inextricable on digital computers (For example, Hava Siegelmann's neural nets can have noncomputable real weights, making them able to compute nonrecursive languages.) or vice versa. (Claude Shannon's idealized analog computer can only solve algebraic differential equations, while a digital computer can solve some transcendental equations as well. However this comparison is not entirely fair since in Claude Shannon's idealized analog computer computations are immediately done; i.e. computation is done in real time. Shannon's model can be adapted to cope with this problem.)[2]
A canonical model of computation over the reals is Blum–Shub–Smale machine (BSS).
If real computation were physically realizable, one could use it to solve NP-complete problems, and even #P-complete problems, in polynomial time. Unlimited precision real numbers in the physical universe are prohibited by the holographic principle and the Bekenstein bound.[3]
See also
[edit]- Hypercomputation, for other such powerful machines.
- Real RAM.
- Quantum finite automaton, for a generalization to arbitrary geometrical spaces.
References
[edit]- ^ Klaus Weihrauch (1995). A Simple Introduction to Computable Analysis.
- ^ O. Bournez; M. L. Campagnolo; D. S. Graça & E. Hainry (Jun 2007). "Polynomial differential equations compute all real computable functions on computable compact intervals". Journal of Complexity. 23 (3): 317–335. doi:10.1016/j.jco.2006.12.005. hdl:10400.1/1011.
- ^ Scott Aaronson, NP-complete Problems and Physical Reality, ACM SIGACT News, Vol. 36, No. 1. (March 2005), pp. 30–52.
Further reading
[edit]- Lenore Blum, Felipe Cucker, Michael Shub, and Stephen Smale (1998). Complexity and Real Computation. Springer. ISBN 0-387-98281-7.
{{cite book}}: CS1 maint: multiple names: authors list (link) - Campagnolo, Manuel Lameiras (July 2001). Computational complexity of real valued recursive functions and analog circuits. Universidade Técnica de Lisboa, Instituto Superior Técnico.
- Natschläger, Thomas, Wolfgang Maass, Henry Markram. The "Liquid Computer" A Novel Strategy for Real-Time Computing on Time Series (PDF).
{{cite book}}: CS1 maint: multiple names: authors list (link) - Siegelmann, Hava (December 1998). Neural Networks and Analog Computation: Beyond the Turing Limit. Springer. ISBN 0-8176-3949-7.
- Siegelmann, Hava T.; Sontag, Eduardo D. (1995). "On the computational power of neural nets" (PDF). Journal of Computer and System Sciences. 50 (1): 132–150. doi:10.1006/jcss.1995.1013. MR 1322637.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
EncycloReader
is supported by the 
KSF