Computability on continuous, lower semi-continuous and upper semi-continuous real functions

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 109-133

  Weihrauch, Klaus ^a   Zheng, Xizhong ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Computability; Continuous real function; Effective analysis; Semi continuous real function

Indexed keywords

EID: 0011569705     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00045-0     Document Type: Article

References (27)

1. A. Asperti, A. Ciabattoni, Effective applicative structures, in: D. Pitt, D. Rydeheard, P. Johnstone (Eds.), Category Theory and Computer Science, Proc. CTCS'95, Cambridge, United Kingdom, August 1995.
2. R. Baire, Sur les séries a termes continus et tous de même signe, Bull. Soc. Math. France 32 (1904) 125-128.
3. A. Brown, C. Pearcy, Introduction to Analysis, Springer, Berlin, 1995.
4. J. Dugundji, Topology, Allyn and Bacon, Boston, 1966.
5. I. Ekeland, R. Temam, Convex Analysis and Variational Problems, North-Holland, Amsterdam, 1976.
6. R. Engelking, General Topology, Heldermann Verlag, Berlin, 1989.
7. X. Ge, A. Nerode, Effective content of the calculus of variations I: semi-continuity and the chattering lemma, Ann. Pure Appl. Logic 79 (1-3) (1996) 127-146.
8. R. Horst, P. Pardalos, N. Thoai, Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht, 1995.
9. Ker-I Ko, Complexity Theory of Real Functions, Birkhäuser, Berlin, 1991.
10. Ch. Kreitz, K. Weihrauch, Theory of representations, Theoret. Comput. Sci. 38 (1985) 35-53.
11. Ch. Kreitz, K. Weihrauch, Compactness in constructive analysis revisited, Ann. Pure Appl. Logic 36 (1987) 29-38.
12. M. Pour-El, J. Richards, Computability in Analysis and Physics, Springer, Berlin, 1989.
13. A. Reiser, K. Weihrauch, Natural numberings and generalized computability, Elektronische Informationsverarbeitung und Kybernetik 16 (1980) 1-3, 11-20.
14. J.I. Richards, Q. Zhou, Computability of closed and open sets in Euclidean space, Preprint, 1992.
15. R.M. Robinson, Review of "R. Peter: 'Rekusive Funktionen', Akad. Kiado. Budapest, 1951", J. Symbol. Logic 16 (1951) 280.
16. H. Jr. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
17. W. Rudin, Real and Complex Analysis, McGraw-Hill, New York, 1974.
18. H. Strong, Algebraically generalized recursive function theory, IBM J. Res. Dev. 12 (1968) 465-475.
19. H. Tong, Some characterizations of normal and perfectly normal space, Duke Math. J. 19 (1952) 289-292.
20. K. Weihrauch, Type-2 recursion theory, Theoret. Comput. Sci. 38 (1985) 17-33.
21. K. Weihrauch, Computability, EATCS Monographs on Theoretical Computer Secience, vol. 9, Springer, Berlin, 1987.
22. K. Weihrauch, Effektive Analysis, Correspondence Course, FernUniversität, Hagen, 1994.
23. K. Weihrauch, A simple introduction to computable analysis, Informatik-Berichte Nr. 171, FernUniversität, Hagen, 1995.
24. K. Weihrauch, A foundation for computable analysis, in: D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, Logic, Proc. DMTCS'96, Springer, Singapore, 1997, pp. 66-89.
25. K. Weihrauch, V. Brattka, Computable subsets of Euclidean space, Presented at Workshop of Computability and Complexity in Analysis, Dagstuhl, Germany, April 1997.
26. K. Weihrauch, Ch. Kreitz, Representations of the real numbers and of the open subsets of the real numbers, Ann. Pure Appl. Logic 35 (1987) 247-260.
27. K. Weihrauch, X. Zheng, Effectiveness of the global modulus of continuity on metric spaces, CTCS'97, Margherita Ligure (Genoa), Italy, September 1997.