From axiomatics to intrinsic characterization: Some open problems in computable analysis

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 319-329

  Pour El, Marian Boykan ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Banach space; Computability structure

Indexed keywords

EID: 0009927387     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00294-7     Document Type: Article

References (26)

1. J.E. Fenstad, General Recursion Theory, An Axiomatic Approach, Perspectives in Mathematical Logic, Springer, Berlin, 1980.
2. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
3. A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math. 44 (1957) 61-71.
4. P. Hertling, Effectivity and Effective Continuity of Functions between Computable Metric Spaces, Combinatorics, Complexity and Logic: Proc. DMTCS, 1996, pp. 264-275.
5. S.C. Kleene, Recursive functionals and quantifiers of finite types I, Trans. Amer. Math. Soc. 91 (1959) 1-52; II (1963) 106-142.
6. S.C. Kleene, Recursive functionals and quantifiers of finite types I, Trans. Amer. Math. Soc. 91 (1959) 1-52; II (1963) 106-142.
7. G. Kreisel, A notion of mechanistic theory, Synthese 29 (1974) 1-16.
8. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, I, C.R. Acad. Sci. Paris 240 (1955) 2478-2480; II 241 (1955) 13-14; III 241 (1955) 151-153.
9. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, I, C.R. Acad. Sci. Paris 240 (1955) 2478-2480; II 241 (1955) 13-14; III 241 (1955) 151-153.
10. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, I, C.R. Acad. Sci. Paris 240 (1955) 2478-2480; II 241 (1955) 13-14; III 241 (1955) 151-153.
11. G. Metakides, A. Nerode, R.A. Shore, Recursive limits on the Hahn Banach theorem, in: M. Rosenblatt (Ed.), E. Bishop, Reflection on Him and Research, San Diego, 1983, pp. 85-91, Contemp. Math., vol. 39, Amer. Math. Soc., Providence.
12. T. Mori, Y. Tsujii, M. Yasugi, Computability Structures on Metric Spaces, Combinatorics, Complexity and Logic: Proc. DMTCS'96, pp. 351-362.
13. Y. Moschovakis, Elementary Induction on Abstract Structures, Studies in Logic and Foundation of Mathematics, North-Holland, Amsterdam, 1974.
14. D. Normann, Recursion on the Countable Functionals, Lecture notes in Mathematics, vol. 811, 1980, Springer, Berlin.
15. M.B. Pour-El, J. Caldwell, On a simple definition of computable function of a real variable - with applications to functions of a complex variable, Z. Math. Logik, Grundlagen Math. 21 (1975) 1-19.
16. M.B. Pour-El, I. Richards, The wave equation with computable initial data such that its unique solution is not computable, Adv. in Math. 39 (1981) 215-239.
17. M.B. Pour-El, I. Richards, Computability and noncomputability in classical analysis, Trans. Amer. Math. Soc. 275 (1983) 539-560.
18. M.B. Pour-El, I. Richards, Noncomputability in analysis and physics: a complete determination of the class of noncomputable linear operators, Adv. in Math. 48 (1983) 44-74.
19. M.B. Pour-El, I. Richards, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, Adv. in Math. 63 (1987) 1-41.
20. M.B. Pour-El, I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989.
21. G. Sacks, Higher Recursion Theory, Perspectives in Mathematical Logic, Springer, Berlin, 1990.
22. M. Washihara, Computability and Fréchet spaces, Math. Japon. 42 (1) (1995) 1-13.
23. M. Washihara, M. Yasugi, Computability and metrics in a Fréchet space, Math. Japon. 43 (3) (1996) 431-443.
24. K. Weihrauch, Computability, Springer, Berlin, 1987.
25. K. Weihrauch, Computability on computable metric spaces, Theoret. Comput. Sci. 113 (1993) 191-210.
26. Q. Zhou, Computable real-valued functions on recursive open and closed subsets of Euclidean space, Math. Logic Q. 42 (1996) 379-409.