Abstract
We present a modified real RAM model which is equipped with the usual discrete and real-valued arithmetic operations and with a finite precision test <k which allows comparisons of real numbers only up to a variable uncertainty 1/k+1 Furthermore our feasible RAM has an extended semantics which allows approximative computations. Using a logarithmic complexity measure we prove that all functions computable on a feasible RAM in time O(t) can be computed on a Turing machine in time O(t 2 · log(t) · log log (t)). Vice versa all functions computable on a Turing machine in time O(t) are computable on a feasible RAM in time O(t). Thus our real RAM model does not only express exactly the computational power of Turing machines on real numbers (in the sense of Grzegorczyk), but it also yields a high-level tool for realistic time complexity estimations on real numbers.
Preview
Unable to display preview. Download preview PDF.
References
A. Avizienis, Signed-Digit Number Representations for Fast Parallel Arithmetic, IRE Transactions on Electronic Computers vol. EC-10 (1961) 389–400
L. Blum, M. Shub & S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. of the Amer. Math. Soc. 21 (1989) 1–46
V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoretical Computer Science 162 (1996) 45–77
V. Brattka & P. Hertling, Feasible real random access machines, Informatik Berichte 193, FernUniversität Hagen (1995)
R.P. Brent, Fast Multiple-Precision Evaluation of Elementary Functions, J. of the ACM 23, No. 2 (1976) 242–251
C. Burnikel, K. Mehlhorn & S. Schirra, On degeneracy in geometric computations, Proc. of the 5th ACM-SIAM Symp. on Discrete Algorithms (1994) 16–23
A. Grzegorczyk, On the definition of computable real continuous functions, Fund. Math. 44 (1957) 61–71
P. Hertling & K. Weihrauch, Levels of degeneracy and exact lower complexity bounds for geometric algorithms, Proc. of the Sixth Can. Conf. on Comp. Geometry (1994) 237–242
G. Hotz, G. Vierke & B. Schieffer, Analytic machines, Electronic Colloquium on Computational Complexity, TR 95-025 (1995)
K.-I Ko, Complexity Theory of Real Functions, Birkhäuser, Boston (1991)
P. Koiran, A weak version of the Blum-Shub-Smale model, Proc. 34th IEEE Symposium on Foundations of Computer Science (1993) 486–495
D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I–III, Comptes Rendus 240/241 (1955) 2478–2480/13–14,151–153,1250–1252
N.Th. Müller, Computational complexity of real functions and real numbers, Informatik Berichte 59, FernUniversität Hagen (1986)
N.Th. Müller, Towards a real real RAM: a prototype using C++, Proc. of the Workshop on Computability and Complexity in Analysis, Trier (1996) 59–66
E. Novak, The real number model in numerical analysis, Journal of Complexity 11, No. 1 (1995) 57–73
M.B. Pour-El & J. Richards, Computability in Analysis and Physics, Springer, Berlin (1989)
F. Preparata & M. Shamos, Computational Geometry, Springer, New York (1985)
M. Schröder, Topological Spaces Allowing Type 2 Complexity Theory, Proceedings of the Workshop on Computability and Complexity in Analysis 95, Informatik Berichte 190, FernUniversität Hagen (1995)
J. Traub, G. Wasilkowski & H. Woźniakowski, Information-Based Complexity, Academic Press, New York (1988)
K. Weihrauch, Computability, Springer, Berlin (1987)
K. Weihrauch, A Simple Introduction to Computable Analysis, Informatik Berichte 171, FernUniversität Hagen (1995)
K. Weihrauch, On the complexity of online computations of real functions, Journal of Complexity 7 (1991) 380–394
K. Weihrauch & Ch. Kreitz, Type 2 computational complexity of functions on Cantor's space, Theoretical Computer Science 82 (1991) 1–18
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brattka, V., Hertling, P. (1996). Feasible real random access machines. In: Jeffery, K.G., Král, J., Bartošek, M. (eds) SOFSEM'96: Theory and Practice of Informatics. SOFSEM 1996. Lecture Notes in Computer Science, vol 1175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037415
Download citation
DOI: https://doi.org/10.1007/BFb0037415
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61994-9
Online ISBN: 978-3-540-49588-8
eBook Packages: Springer Book Archive