An effective Riemann Mapping Theorem

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 225-265

  Hertling, Peter ^a  

^a NONE

Author keywords

Computable analysis; Computable conformable mappings; Recursively enumerable subsets of real Euclidean spaces; Riemann mapping theorem

Indexed keywords

EID: 0001014771     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00290-4     Document Type: Article

References (29)

1. L. Ahlfors, Complex Analysis, 2nd ed., McGraw-Hill, New York, 1966.
2. E. Bishop, D.S. Bridges, Constructive Analysis, Springer, Berlin, 1985.
3. H. Cheng, A constructive Riemann mapping theorem, Pacific J. Math. 44 (2) (1973) 435-454.
4. A.W. Chou, Some complexity issues in complex analysis, in: K.-I. Ko, K. Weihrauch (Eds.), Proc. Workshop on Computability and Complexity in Analysis, Informatik-Berichte, vol. 190, FernUniversität Hagen, 1995, pp. 91-98.
5. 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, Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994. pp. 114-128; 3rd Internat. Symp. LFCS'94, St. Petersburg, Russia, 11-14 July, 1994.
6. 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, Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994. pp. 114-128; 3rd Internat. Symp. LFCS'94, St. Petersburg, Russia, 11-14 July, 1994.
7. A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
8. A. Grzegorczyk, On the definitions of computable real continuous functions, Fund. Math. 44 (1957) 61-71.
9. J. Hauck, Berechenbare reelle Funktionen, Z. Math. Logik Grundlagen Math. 19 (1973) 121-140.
10. J. Hauck, Konstruktive Darstellungen in topologischen Räumen mit rekursiver Basis, Z. Math. Logik Grundlagen Math. 26 (1980) 565-576.
11. P. Henrici, Applied and Computational Complex Analysis, vol. 3, Wiley, New York, 1986.
12. K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991.
13. P. Koebe, Ueber eine neue Methode der konformen Abbildung und Uniformisierung, Nachr. Königl. Ges. Wiss. Göttingen, Math. Phys. Kl., 1912, pp. 844-848.
14. C. Kreitz, K. Weihrauch, Theory of representations, Theoret. Comput. Sci. 38 (1985) 35-53.
15. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I-III, Comptes Rendus Académie des Sciences 240/241 (1955) 2478-2480/13-14, 151-153.
16. D. Lacombe, Les ensembles récursivement ouverts ou fermés, et leurs applications à l'Analyse récursive, Comptes Rendus Académie des Sciences Paris 246 (1958) 28-31.
17. T. Mori, Y. Tsujii, M. Yasugi, Computability structures on metric spaces, in: D.S. Bridges et al. (Eds.), Combinatorics, Complexity, and Logic, Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pp. 351-362; Proc. of DMTCS'96.
18. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Springer, Berlin, 1989.
19. T. Radó, Über die Fundamentalabbildung schlichter Gebiete, Acta. Sci. Math. Szeged 1 (1922/23) 240-251.
20. R. Remmert, Funktionentheorie, vol. II, Springer-Verlag, Berlin, 1991.
21. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
22. K. Weihrauch, Type 2 recursion theory, Theoret. Comput. Sci. 38 (1985) 17-33.
23. K. Weihrauch, Computability, Springer, Berlin, 1987.
24. K. Weihrauch, Computability on computable metric spaces, Theoret. Comput. Sci. 113 (1993) 191-210.
25. K. Weihrauch, A Simple Introduction to Computable Analysis, 2nd ed., Tech. Report 171, FernUniversität Hagen, July 1995.
26. K. Weihrauch, An Introduction to Computable Analysis, to appear.
27. K. Weihrauch, V. Brattka, Computability on subsets of euclidean space I: closed and compact subsets, preprint, June 1997.
28. K. Weihrauch, C. Kreitz, Representations of the real numbers and of the open subsets of the real numbers, Ann. Pure Appl. Logic 35 (1987) 247-260.
29. Q. Zhou, Computable real-valued functions on recursive open and closed subsets of Euclidean space, Math. Logic Quart. 42 (1996) 379-409.