On the Time Complexity of Partial Real Functions

Journal of Complexity

Volumn 16, Issue 1, 2000, Pages 363-376

  Hemmerling, Armin ^a  

^a UNIVERSITY OF GREIFSWALD   (Germany)

Author keywords

Computable real function; approximate computability; time complexity; topological arithmetical hierarchy

Indexed keywords

EID: 0000958786     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1999.0539     Document Type: Article

References (15)

1. van den Dries L. Alfred Tarski's elimination theory for real closed fields. J. Symbolic Logic. 53:1988;7-19.
2. Grzegorczyk A. Computable functionals. Fund. Math. 42:1955;168-202.
3. Hemmerling A. On approximate and algebraic computability over the real numbers. Theoret. Comput. Sci. 219:1999;185-223.
4. Hinman P. G. Recursion-Theoretic Hierarchies. 1978;Springer-Verlag, Berlin.
5. Ko K.-I. Complexity Theory of Real Functions. 1991;Birkhäuser, Boston.
6. Ko K.-I., Friedman H. Computational complexity of real functions. Theoret. Comput. Sci. 20:1982;323-352.
7. Kreitz C., Weihrauch K. Complexity theory on real numbers and functions. Lecture Notes in Comput. Sci. 1983;Springer-Verlag, New York/Berlin. p. 165-174.
8. Lacombe D. Extension de la notion de fonction recursive aux fonctions d'un ou plusieurs variables reelles, I. C. R. Acad. Sci. Paris. 240:1955;2478-2480.
9. Moschovakis Y. N. Descriptive Set Theory. 1980;North-Holland, Amsterdam.
10. Odifreddi P. Classical Recursion Theory. 1989;North-Holland, Amsterdam.
11. Pour-El M. B., Richards J. I. Computability in Analysis and Physics. 1989;Springer-Verlag, Berlin.
12. Rogers H. Jr. Theory of Recursive Functions and Effective Computability. 1967;McGraw-Hill, New York.
13. Turing A. M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42:1936;230-265.
14. Weihrauch K. Computability. 1987;Springer-Verlag, Berlin.
15. K. Weihrauch, A simple introduction to computable analysis, Informatik-Berichte 171-7/1995, FernUniv. Hagen, 1995.