Computability on subsets of metric spaces

Theoretical Computer Science

Volumn 305, Issue 1-3, 2003, Pages 43-76

  Brattka, Vasco ^a   Presser, Gero ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Computable analysis; Computable metric spaces; Recursive and recursively enumerable subsets; Representations of hyperspaces

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; RECURSIVE FUNCTIONS; SET THEORY;

HYPERSPACES;

COMPUTER SCIENCE;

EID: 0042405005     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00693-X     Document Type: Conference Paper

References (29)

1. Beer G. Topologies on Closed and Closed Convex Sets. 1993;Kluwer Academic, Dordrecht.
2. Bishop E., Bridges D.S. Constructive Analysis. 1985;Springer, Berlin.
3. Blanck J. Effective domain representations of. H(X), the space of compact subsets Theoret. Comput. Sci. 219:1999;19-48.
4. Brattka V. Computable invariance. Theoret. Comput. Sci. 210:1999;3-20.
5. V. Brattka, Recursive and computable operations over topological structures, Informatik Berichte 255, FernUniversität Hagen, Fachbereich Informatik, Hagen, July 1999.
6. V. Brattka, Random numbers and an incomplete immune recursive set, in: P. Widmayer, F. Triguero, R. Morales, M. Hennessg, S. Eidenbenz, R. Conejo (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002. pp. 950-961.
7. V. Brattka, Recursive quasi-metric spaces, Theoret. Comput. Sci. this Vol. (2003).
8. V. Brattka, P. Hertling, Continuity and computability of relations, Informatik Berichte, Vol. 164, FernUniversität Hagen, Hagen, September 1994.
9. Brattka V., Hertling P. Topological properties of real number representations. Theoret. Comput. Sci. 284:2002;241-257.
10. Brattka V., Weihrauch K. Computability on subsets of Euclidean space I. Closed and compact subsets Theoret. Comput. Sci. 219:1999;65-93.
11. Engelking R. General Topology. 1989;Heldermann, Berlin.
12. Giusto M., Simpson S.G. Located sets and reverse mathematics. J. Symbolic Logic. 65:2000;1451-1480.
13. Grzegorczyk A. On the definitions of computable real continuous functions. Fund. Math. 44:1957;61-71.
14. Ko K.-I. Complexity Theory of Real Functions. 1991;Birkhäuser, Boston.
15. Kreitz C., Weihrauch K. A unified approach to constructive and recursive analysis. Richter M., Börger E., Oberschelp W., Schinzel B., Thomas W. Computation and Proof Theory. Lecture Notes in Mathematics. Vol. 1104:1984;259-278 Springer, Berlin.
16. Lacombe D. Les ensembles récursivement ouverts ou fermés, et leurs applications à l'Analyse récursive. Comptes Rendus. 246:1958;28-31.
17. Mazur S. Computable Analysis. 1963;Razprawy Matematyczne, Warsaw.
18. Odifreddi P. Classical Recursion Theory. 1989;North-Holland, Amsterdam.
19. Pour-El M.B., Richards J.I. Computability in Analysis and Physics. 1989;Springer, Berlin.
20. Schröder M. Admissible representations of limit spaces. Blanck J., Brattka V., Hertling P. Computability and Complexity in Analysis. Lecture Notes in Computer Science. Vol. 2064:2001;273-295 Springer, Berlin.
21. Schröder M. Extended admissibility. Theoret. Comput. Sci. 284:2002;519-538.
22. Simpson S.G. Subsystems of Second Order Arithmetic. 1999;Springer, Berlin.
23. Spreen D. On effective topological spaces. J. Symbolic Logic. 63:1998;185-221.
24. Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42:1936;230-265.
25. Weihrauch K. Computability on computable metric spaces. Theoret. Comput. Sci. 113:1993;191-210.
26. Weihrauch K. Computable Analysis. 2000;Springer, Berlin.
27. Weihrauch K., Zheng X. Computability on continuous, lower semi-continuous and upper semi-continuous real functions. Theoret. Comput. Sci. 234:2000;109-133.
28. Yasugi M., Mori T., Tsujii Y. Effective properties of sets and functions in metric spaces with computability structure. Theoret. Comput. Sci. 219:1999;467-486.
29. Zheng X., Brattka V., Weihrauch K. Approaches to effective semi-continuity of real functions. Math. Logic. Quart. 45:1999;481-496.