
AbstractIn this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets. The paper concludes with a comprehensive examination of the Effective Riemann Mapping Theorem and related questions.
conformal mapping, Applications of computability and recursion theory, computable open and closed subsets of closed rectangles of Euclidean space, recursive analysis, Euclidean geometries (general) and generalizations, Riemann Mapping Theorem, Tietze Extension Theorem, Constructive and recursive analysis, Inverse Function Theorem
conformal mapping, Applications of computability and recursion theory, computable open and closed subsets of closed rectangles of Euclidean space, recursive analysis, Euclidean geometries (general) and generalizations, Riemann Mapping Theorem, Tietze Extension Theorem, Constructive and recursive analysis, Inverse Function Theorem
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 31 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
