On approximate and algebraic computability over the real numbers

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 185-223

  Hemmerling, Armin ^a  

^a UNIVERSITY OF GREIFSWALD   (Germany)

Author keywords

Abstract (algebraic) computability; Approximate computability; Arithmetical hierarchies over the reals; Computable real function; Computable real number

Indexed keywords

EID: 0001740463     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00289-8     Document Type: Article

References (42)

1. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, New York, 1998.
2. 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. AMS 21 (1) (1989) 1-46.
3. P. Boldi, S. Vigna, δ-uniform BSS machines, Preprint 1997, J. Complexity, to appear.
4. V. Brattka, P. Hertling, Feasible real random access machines, Informatik-Berichte, Fern Univ. Hagen 193, 1995; revised version 1998, Theoret. Comput. Sci., to appear.
5. V. Brattka, P. Hertling, Feasible real random access machines, Informatik-Berichte, Fern Univ. Hagen 193, 1995; revised version 1998, Theoret. Comput. Sci., to appear.
6. F. Cucker, The arithmatical hierarchy over the reals, J. Logic Comput. 2 (3) (1992) 375-395.
7. L. van den Dries, Alfred Tarski's elimination theory for real closed fields, J. Symbolic Logic 53 (1988) 7-19.
8. E. Engeler, Algorithmic properties of structures, Math. System Theory 1 (1967) 183-195.
9. A.P. Ershov, Abstract Computability on Algebraic Structures, Lecture Notes in Computer Science, vol. 122, 1981, pp. 397-420.
10. H. Friedman, Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory, Logic Colloquium 1969, North-Holland, Amsterdam, 1971, pp. 361-390.
11. H. Friedman, R. Mansfield, Algorithmic procedures, Trans. AMS 332 (1992) 297-312.
12. A. Hemmerling, Computability of string functions over algebraic structures, Math. Log. Quart. 44 (1998) 1-44.
13. P. Hertling, K. Weihrauch, Levels of degeneracy and exact lower bounds for geometric algorithms, Proc. 6th Canadian Conf. on Computational Geometry, Saskatoon, 1994, pp. 237-242.
14. H. Heuser, Das Unendliche in Philosophie, Theologie und Mathematik. DMV-Mitteilungen 3/97 (1997) 35-38.
15. P.G. Hinman, Recursion-Theoretic Hierarchies, Springer, Berlin, 1978.
16. G. Hotz, T. Chadzelek, Analytic machines, Preprint 1997.
17. G. Hotz, G. Vierke, B. Schieffer, Analytic machines, Electron. Colloq. Comput. Complexity (1995) TR 95-025.
18. Iu. I. Janov, The logical schemes of algorithms, Problems Cybernet. 1 (1960) 82-140.
19. A.J. Kfoury, Definability by programs in first-order structures, Theoret. Comput. Sci. 25 (1983) 1-66.
20. S.C. Kleene, Introduction to Metamathematics, North-Holland, Amsterdam, 1952.
21. K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991.
22. K.-I. Ko, H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci. 20 (1982) 323-352.
23. C. Kreitz, K. Weihrauch, Complexity Theory on Real Numbers and Functions, Lecture Notes in Computer Science, vol. 145, 1983, pp. 165-174.
24. D.C. Luckham, D.M.R. Park, M.S. Paterson, On formalised computer programs, JCSS 4 (1970) 220-249.
25. F. Meyer auf der Heide, J. Wiedermann, Numerical RAM: a realistic machine model for scientific computing, Preprint 1997.
26. Y.N. Moschovakis, Descriptive Set Theory, North-Holland, Amsterdam, 1980.
27. P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, 1989.
28. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Springer, Berlin, 1989.
29. P.P. Preparata, M.I. Shamos, Computational Geometry, Springer, Berlin, 1985.
30. H. Rogers Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
31. J.C. Shepherdson, On the definition of computable function of a real variable, Zeitschr. f. math. Logik und Grundlagen d. Math., Bd. 22 (1976) 391-402.
32. J.C. Shepherdson, Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory, in: L.H. Harrington et al. (Eds.), Harvey Friedman's Research on the Foundations of Mathematics, North-Holland, Amsterdam, 1985, pp. 285-308.
33. J.C. Shepherdson, Computational complexity of real functions, in: L.H. Harrington et al. (Eds.), Harvey Friedman's Research on the Foundations of Mathematics, North-Holland, Amsterdam, 1985, pp. 309-315.
34. A. Tarski, A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, 1951.
35. J.V. Tucker, J.I. Zucker, Program Correctness Over Abstract Data Types, with Error-State Semantics, North-Holland P.C., Amsterdam, 1988.
36. J.V. Tucker, J.I. Zucker, Computation by 'while' programs on topological partial algebras, McMaster University, Department, of Computer Science, 1998, TR 98-02.
37. J.V. Tucker, J.I. Zucker, Computable functions and semicomputable sets on many-sorted algebras, Preprint 1998, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 5, Oxford Univ. Press, Oxford, to appear.
38. A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc., vol. 42, 1936, pp. 230-265; vol. 43, 1937, pp. 544-546.
39. A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc., vol. 42, 1936, pp. 230-265; vol. 43, 1937, pp. 544-546.
40. K. Weihrauch, Computability, Springer, Berlin, 1987.
41. K. Weihrauch, A simple introduction to computable analysis, Informatik-Berichte 171-7/1995, FernUniv. Hagen, 1995.
42. q in two computing models -Blum-Shub-Smale machine and Turing machine, Theoret. Comput. Sci. 197 (1998) 79-94.