An effective Riemann Mapping Theorem

DOI10.1016/S0304-3975(98)00290-4zbMath0916.68039OpenAlexW2051098005MaRDI QIDQ1292405

Peter H. Hertling

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00290-4

zbMATH Keywords

computable analysisRiemann mapping theoremcomputable conformable mappingsrecursively enumerable subsets of real Euclidean spaces

Mathematics Subject Classification ID

Related Items (24)

Computability and Analysis, a Historical Approach ⋮ Effectively open real functions ⋮ Effective Riemann mappings of multiply connected domains and Riemann surfaces ⋮ Computable Carathéodory theory ⋮ A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ On the computational complexity of the Riemann mapping ⋮ A Comparison of Certain Representations of Regularly Closed Sets ⋮ Towards Computability over Effectively Enumerable Topological Spaces ⋮ Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains ⋮ Jordan Areas and Grids ⋮ Lower Bounds on the Continuation of Holomorphic Functions ⋮ An effective Carathéodory theorem ⋮ Computing conformal maps of finitely connected domains onto canonical slit domains ⋮ Carathéodory convergence and harmonic measure ⋮ Computable analysis and Blaschke products ⋮ Non computable Mandelbrot-like sets for a one-parameter complex family ⋮ Conformal mapping in linear time ⋮ Solving Riemann-Hilbert problems with meromorphic functions ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computing boundary extensions of conformal maps ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Computable Complex Analysis ⋮ Computable Geometric Complex Analysis and Complex Dynamics

Cites Work

• Type 2 recursion theory
• Theory of representations
• Representations of the real numbers and of the open subsets of the set of real numbers
• Computability on computable metric spaces
• A constructive Riemann mapping theorem
• Computable functionals
• On the definitions of computable real continuous functions
• Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis
• Berechenbare Reelle Funktionen
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An effective Riemann Mapping Theorem