Computable Banach spaces via domain theory

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 169-184

  Edalat, Abbas ^a   Sünderhauf, Philipp ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000925563     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00288-6     Document Type: Article

References (28)

1. S. Abramsky, A. Jung, Domain theory, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 3, Clarendon Press, Boca Raton, FL, 1994, pp. 1-168.
2. G. Alefeld, J. Herzberger, Introduction to Interval Arithmetic, Academic Press, New York, 1983.
3. J. Blanck, Computability on topological spaces by effective domain representations, Ph.D. Thesis, Upsalla University, 1997.
4. J. Blanck, Domain representability of metric spaces, Ann. Pure Appl. Logic 83 (1997) 225-247.
5. G.S. Ceitin, Algorithmic operators in constructive metric spaces, Translations AMS 64 (1967) 1-80.
6. A. Edalat, Domains for computation in mathematics, physics and exact real arithmetic, Bull. Symbolic Logic 3 (4) (1997) 401-452.
7. A. Edalat, R. Heckmann, A computational model for metric spaces, Theoret. Comput. Sci. 193 (1-2) (1998) 53-73.
8. A. Edalat, P.J. Potts, A new representation for exact real numbers, Electronic Notes in Theoretical Computer Science, vol. 6, 1997. URL: http://wvw.elsevier.nl/locate/entcs/volume6.html.
9. A. Edalat, Ph. Sünderhauf, A domain theoretic approach to computability on the real line. Theoret. Comput. Sci. 210 (1) (1998) 73-98.
10. Y.L. Ershov, Computable functionals of finite type, Algebra Logic 11 (4) (1972) 203-242.
11. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
12. J. Hauck, Berechenbare reelle Funktionenfolgen, Zeitschr. f. Math. Logik und Grundlagen d. Math. 19 (1973) 121-140.
13. Chr. Kreitz, K. Weihrauch, Theory of representations, Theoret. Comput. Sci. 38 (1985) 35-53.
14. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, C.R. Acad. Sci. Paris 240 (1955) 2478-2480, 241 (1955) 13-14, 241 (1955) 151-153.
15. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, C.R. Acad. Sci. Paris 240 (1955) 2478-2480, 241 (1955) 13-14, 241 (1955) 151-153.
16. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles, C.R. Acad. Sci. Paris 240 (1955) 2478-2480, 241 (1955) 13-14, 241 (1955) 151-153.
17. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
18. Y.N. Moschovakis, Recursive metric spaces, Fund. Math. 55 (1964) 215-238.
19. P.J. Potts, A. Edalat, Exact real computer arithmetic, March 1997, Department of Computing Technical Report DOC 97/9, Imperial College, available from http://theory.doc.ic.ac.uk/∼pjp.
20. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Springer, Berlin, 1989.
21. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
22. D.S. Scott, Outline of a mathematical theory of computation, Proc. of 4th Annual Princeton Conf. on Information Sciences and Systems, 1970, pp. 169-176.
23. V. Stolenberg-Hansen, J.V. Tucker, Complete local rings as domains, J. Symbolic Logic 53 (1988) 603-624.
24. V. Stolenberg-Hansen, J.V. Tucker, Effective algebras, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 4, Clarendon Press, Boca Raton, FL, 1995, pp. 357-526.
25. V. Stolenberg-Hansen, J.V. Tucker, Concrete models of computation for topological algebras, Technical Report 1997:34, Department of Mathematics, Upsalla University, 1997.
26. K. Weihrauch, Computability, volume 9 of EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1987.
27. K. Weihrauch, Computability on computable metric spaces, Theoret. Comput. Sci. 113 (1993) 191-210.
28. K. Weihrauch, A foundation for computable analysis, In: D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity and Logic, Discrete Mathematics and Theoretical Computer Science, Singapore, 1997, pp. 66-89, Proceedings of DMTCS'96, Springer, Berlin.