Computability on subsets of Euclidean space I: Closed and compact subsets

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 65-93

  Brattka, Vasco ^a   Weihrauch, Klaus ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Computable analysis; Recursive sets; Representations of hyperspaces

Indexed keywords

EID: 0001799332     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00284-9     Document Type: Article

References (45)

1. G. Beer, Topologies on Closed and Closed Convex Sets, Mathematics and Its Applications, vol. 268, Kluwer Academic, Dordrecht, 1993.
2. E. Bishop, D.S. Bridges, Constructive Analysis, Grundlehren der mathematischen Wissenschaft, vol. 279, Springer, Berlin, 1985.
3. L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation, Springer, New York, 1998.
4. L. Blum, M. Shub, 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(1) (1989) 1-46.
5. L. Blum, S. Smale, The Gödel incompleteness theorem and decidability over a ring, in: M.W. Hirsch, J.E. Marsden, M. Shub (Eds.), From Topology to Computation: Proc. Smalefest, Springer, New York, 1993, pp. 321-339.
6. P. Boldi, S. Vigna, δ-uniform BSS machines, Journal of Complexity 14(2) (1998) 234-256.
7. V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoret. Comput. Sci. 162 (1996) 45-77.
8. V. Brattka, Computable invariance, Theoret. Comput. Sci. 210 (1999) 3-20.
9. D. Bridges, F. Richman, W. Yuchuan, Sets, complements and boundaries, Indag. Math. 7(4) (1996) 425-445.
10. A. Chou, K.-I. Ko., Computational complexity of two-dimensional regions, SIAM J. Comput. 24 (1995) 923-947.
11. R. Engelking, General Topology, Sigma Series in Pure Mathematics, vol. 6, Heldermann, Berlin, 1989.
12. X. Ge, Some algorithms in Euclidean space and group representations, Thesis, University of Minnesota, Minneapolis, May 1993.
13. X. Ge, A. Nerode, On extreme points of convex compact Turing located sets, in: A. Nerode, Yu.V. Matiyasevich (Eds.), Logical Foundations of Computer Science, 3rd Internat. Symp., LFCS'94, St. Petersburg, Russia, 11-14 July 1994. Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994, pp. 114-128.
14. M. Giusto, S.G. Simpson, Located sets and reverse mathematics, extended abstract, May 1997.
15. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
16. J. Hauck, Berechenbare reelle Funktionen, Z. math. Logik Grundlagen Math. 19 (1973) 121-140.
17. K.-I. Ko, Complexity Theory of Real Functions, progress in Theoretical Computer Science, Birkhäuser, Boston, 1991.
18. K.-I. Ko, H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci. 20 (1982) 323-352.
19. K.-I. Ko, K. Weihrauch, On the measure of two-dimensional regions with polynomial-time computable boundaries, in: S. Homer, J.-Y. Cai (Eds.), 11th Annual IEEE Conf. on Computational Complexity, IEEE Computer Society Press, Los Alamitos, 1996, pp. 150-159.
20. G. Kreisel, D. Lacombe, Ensembles récursivement mesurables et ensembles récursivement ouverts et fermés, C. R. Acad. Sci. Paris 245 (1957) 1106-1109.
21. C. Kreitz, K. Weihrauch, A unified approach to constructive and recursive analysis, in: M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, W. Thomas (Eds.), Computation and Proof Theory, Proc. Logic Colloquium, Aachen, 18-23 July 1983, Part II. Lecture Notes in Mathematics, vol. 1104, Springer, Berlin, 1984, pp. 259-278.
22. C. Kreitz, K. Weihrauch, Theory of representations, Theoret. Comput. Sci. 38 (1985) 35-53.
23. C. Kreitz, K. Weihrauch, Compactness in constructive analysis revisited, Ann. Pure Appl. Logic 36 (1987) 29-38.
24. D. Lacombe, Classes récursivement fermés et fonctions majorantes, C. R. Acad. Sci. Paris 240 (1955) 716-718. Théorie des fonctions.
25. D. Lacombe, Les ensembles récursivement ouverts ou fermés, et leurs applications àl'Analyse récursive, C. R. Acad. Sci. Paris 246 (1958) 28-31. Logique.
26. G. Metakides, A. Nerode, The introduction of non-recursive methods into mathematics, in: A.S. Troelstra, D. van Dalen (Eds.), The L.E.J. Brouwer Centenary Symp., Proc. Conf. Noordwijkerhout, 8-13 June 1981. Studies in Logic and the Foundations of Mathematics, vol. 110, North-Holland, Amsterdam, 1982, pp. 319-335.
27. T. Mori, Y. Tsujii, M. Yasugi, Computability structures on metric spaces, in: D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, and Logic, Proc. DMTCS'96. Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pp. 351-362.
28. A. Nerode, W.-Q. Huang, Application of pure recursion theory in recursive analysis, Acta Math. Sin. 28 (1985) 625-636 (in Chinese).
29. P. Odifreddi, Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, vol. 129, North-Holland, Amsterdam, 1989.
30. R. Penrose, The Emperor's New Mind, Concerning Computers, Minds and The Laws of Physics, Oxford University Press, New York, 1989.
31. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989.
32. A. Reiser, K. Weihrauch, Natural numberings and generalized computability, Elektron. Inform. Kybernet. 16 (1980) 11-20.
33. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
34. J.V. Tucker, J.I. Zucker, Examples of semicomputable sets of real and complex numbers, in: J.P. Myers, M.J. O'Donnell (Eds.), Constructivity in Computer Science, Springer, Berlin, 1992, pp. 179-198. Summer Symp. San Antonio, TX, 19-22 June 1991.
35. K. Weihrauch, Type 2 recursion theory, Theoret. Comput. Sci. 38 (1985) 17-33.
36. K. Weihrauch, Computability, EATCS Monographs on Theoretical Computer Science, vol. 9, Springer, Berlin, 1987.
37. K. Weihrauch, Computability on computable metric spaces, Theoret. Comput. Sci. 113 (1993) 191-210.
38. K. Weihrauch, Effektive Analysis, Correspondence course 1681, FernUniversität Hagen, 1994.
39. K. Weihrauch, A simple introduction to computable analysis, 2nd ed., Informatik Berichte 171, FernUniversität Hagen, Hagen, July 1995.
40. 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, Proc. DMTCS'96. Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pp. 66-89.
41. K. Weihrauch, An Introduction to Computable Analysis, 1999, to appear.
42. K. Weihrauch, C. Kreitz, Representations of the real numbers and of the open subsets of the set of real numbers, Ann. Pure Appl. Logic 35 (1987) 247-260.
43. N. Zhong, Effective separation axioms, Questions Answers Gen. Topology 14(2) (1996) 177-185.
44. N. Zhong, Recursively enumerable subsets of Rq in two computing models: Blum-Shub-Smale machine and Turing machine, Theoret. Comput. Sci. 197 (1998) 79-94.
45. Q. Zhou, Computable real-valued functions on recursive open and closed subsets of Euclidean space, Math. Logic Q. 42 (1996) 379-409.