Feasible Real Random Access Machines

Avizienis, 1961, Signed-digit number representations for fast parallel arithmetic, IRE Trans. Electron. Comput., EC-10, 389, 10.1109/TEC.1961.5219227 Blum, 1989, On a theory of computation and complexity over the real numbers:NP, Bull. of the Amer. Math. Soc., 21, 1, 10.1090/S0273-0979-1989-15750-9 Boldi, 1998, δ, J. Complexity, 14, 234, 10.1006/jcom.1998.0475 Brattka, 1996, Recursive characterization of computable real-valued functions and relations, Theor. Comput. Sci., 162, 45, 10.1016/0304-3975(95)00249-9 Brent, 1976, Fast multiple-precision evaluation of elementary functions, J. Assoc. Comput. Mach., 23, 242, 10.1145/321941.321944 Burnikel, 1994, On degeneracy in geometric computations Grzegorczyk, 1957, On the definition of computable real continuous functions, Fund. Math., 44, 61, 10.4064/fm-44-1-61-71 Hertling, 1994, Levels of degeneracy and exact lower complexity bounds for geometric algorithms Hotz, 1995, Analytic machines, Electronic Colloquium on Computational Complexity, TR Ko, 1991 Koiran, 1993, A weak version of the Blum–Shub–Smale model Lacombe, 1955, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I–III, Comptes Rendus, 240/241, 2478 Meyer auf der Heide, F. Wiedermann, J. Numerical RAM: A realistic machine model for scientific computing Müller, 1986, Computational complexity of real functions and real numbers, Informatik Berichte Müller, 1996, Towards a real Real RAM: a Prototype using C++, 96-44 Novak, 1995, The real number model in numerical analysis, J. Complexity, 11, 57, 10.1006/jcom.1995.1002 Pour-El, 1989 Preparata, 1985 Schönhage, 1985, Quasi-GCD computations, J. Complexity, 1, 118, 10.1016/0885-064X(85)90024-X Schröder, 1995, Topological spaces allowing Type 2 complexity theory, 41 Schröder, 1997, Fast online multiplication of real numbers Traub, 1988 Weihrauch, 1987 Weihrauch, 1991, On the complexity of online computations of real functions, J. Complexity, 7, 380, 10.1016/0885-064X(91)90026-T Weihrauch, 1991, Type 2 computational complexity of functions on Cantor's space, Theor. Comput. Sci., 82, 1, 10.1016/0304-3975(91)90168-2 Weihrauch, 1995