Recursive characterization of computable real-valued functions and relations

Theoretical Computer Science

Volumn 162, Issue 1, 1996, Pages 45-77

  Brattka, Vasco ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES; MATHEMATICAL OPERATORS; RECURSIVE FUNCTIONS; TURING MACHINES;

COMPUTABLE REAL VALUED FUNCTIONS; DISCRETE COMPUTABILITY;

COMPUTATION THEORY;

EID: 0030570670     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00249-9     Document Type: Article

References (38)

1. L. Blum, M. Shub and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
2. N. Bourbaki, Theory of Sets (Addison-Wesley, Reading, MA, 1974).
3. V. Brattka, Computable selection in analysis, in: K.-I Ko and K. Weihrauch, eds., Proc. Workshop on Computability and Complexity in Analysis, Informatik Berichte, FernUniversität Hagen 190 (1995) 125-138.
4. V. Brattka and P. Hertling, Continuity and computability of relations, Informatik Berichte, FernUniversität Hagen 164 (1994).
5. V. Brattka and P. Hertling, Feasible real random access machines, Informatik Berichte, FernUniversität Hagen 193 (1995).
6. C. Burnikel, K. Mehlhorn and S. Schirra, On degeneracy in geometric computations, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (1994) 16-23.
7. G. Choquet, Convergences, Annales de l'Université de Grenoble 23 (1947-1948) 55-112.
8. R. Engelking, General Topology (Heldermann, Berlin, 1989).
9. M.H. Escardó, Induction and recursion on the real line, in: C. Hankin, I. Mackie and R. Nagarajan, eds., Proc. 2nd Theory and Formal Methods Workshop 1994 (Imperial College Press, London, 1995) 259-282.
10. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
11. A. Grzegorczyk, On the definition of computable real continuous functions, Fund. Math. 44 (1957) 61-71.
12. J. Hauck, Funktional-Rekursion, Zeitschr. f. math. Logik und Grundlagen d. Math. 18 (1972) 31-36.
13. J. Hauck, Berechenbare reelle Funktionen, Zeitschr. f. math. Logik und Grundlagen d. Math. 19 (1973) 121-140.
14. J. Hauck, Berechenbare reelle Funktionenfolgen, Zeitschr. f. math. Logik und Grundlagen d. Math. 22 (1976) 265-282.
15. F. Hausdorff, Mengenlehre (Dover Publications, New York, 3rd edn., 1927).
16. P. Hertling and K. Weihrauch, Levels of degeneracy and exact lower complexity bounds for geometric algorithms, Proc. 6th Can. Conf. on Comp. Geometry (1994) 237-242.
17. D. Klaua, Konstruktive Analysis (Deutscher Verlag der Wissenschaften, Berlin, 1961).
18. S. Kleene, General recursive functions of natural numbers, Math. Ann. 112 (1936) 727-742.
19. K.-I Ko and H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci. 20 (1982) 323-352.
20. K.-I Ko, Complexity Theory of Real Functions (Birkhäuser, Boston, 1991).
21. K. Kuratowski, Topology, Vol. I&II (Academic Press, New York, 1966/1968).
22. Ch. Kreitz and K. Weihrauch, A unified approach to constructive and recursive analysis, in: Richter et al., eds., Computation and Proof Theory (Springer, Berlin, 1984).
23. 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.
24. E. Michael, Topologies on spaces of subsets, Trans. Amer. Math. Soc. 71 (1951) 152-182.
25. C. Moore, Recursion theory on the reals and continuous-time computation, Theoret. Comput. Sci. this issue.
26. Y.N. Moschovakis, Notes on Set Theory (Springer, New York, 1994).
27. T. Nguyen, A relational model of demonic nondeterministic programs, Int. J. Found. Comp. Sci. 2 (1991) 101-131.
28. M.B. Pour-El and J. Caldwell, On a simple definition of computable functions of a real variable - with applications to functions of a complex variable, Zeitschr. f. math. Logik und Grundlagen d. Math. 21 (1975) 1-19.
29. M.B. Pour-El and J. Richards, Computability in Analysis and Physics (Springer, Berlin, 1989).
30. F. Preparata and M. Shamos, Computational Geometry (Springer, New York, 1985).
31. M. Schröder, Topological spaces allowing type 2 complexity theory, in: K.-I. Ko and K. Weihrauch, eds., Proc. Workshop on Computability and Complexity in Analysis, Informatik Berichte, FernUniversität Hagen 190 (1995) 41-53.
32. J.C. Shepherdson, On the definition of computable functions of a real variable, Zeitschr. f. math. Logik und Grundlagen d. Math. 22 (1976) 391-402.
33. J. Traub, G. Wasilkowski and H. Wozniakowski, Information-Based Complexity (Academic Press, New York, 1988).
34. A. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. 42 (1936-37) 230-265.
35. K. Weihrauch, Computability (Springer, Berlin, 1987).
36. K. Weihrauch, Computability on computable metric spaces. Theoret. Comput. Sci. 113 (1993) 191-210.
37. K. Weihrauch, Grundlagen der Effektiven Analysis, Correspondence Course 1681, FernUniversität Hagen (1994).
38. K. Weihrauch, A Simple Introduction to Computable Analysis, Informatik Berichte 171, FernUniversität Hagen (1995).