Real RAM
In computing, especially computational geometry, a Real RAM (random access machine) is a computational model that operates with real numbers in the mathematical sense,[1] as opposed to standard computers that support only approximate computations with floating-point arithmetic (e.g., IEEE 754), or exact arithmetic which is restricted to integer or rational numbers. Not to be confused with RAM (random access memory). Brattka and Hertling described a theoretical implementation based on a Turing machine.[2]
The model is sometimes referred to as Blum–Shub–Smale machine and the two models are equivalent.
See also
References
- ↑ Brattka, Vasco (April 2000). "Realistic models of computability on the real numbers" (PDF). Research Institute for Mathmatecal Science Kyoto University. pp. 62–75. Retrieved 2 June 2012.
- ↑ Brattka, Vasco; Peter Hertling (1998). "Feasible Real Random Access Machines" (PDF). Journal of Complexity. 14 (4): 490–526. doi:10.1006/jcom.1998.0488.
External links
- Feasible Real Random Access Machines References
- Geometric Computing The Science of Making Geometric Algorithms Work
This article is issued from Wikipedia - version of the 7/10/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.