2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/123208In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of pixels, or by a Turing Machine.Complex VariablesComputational Complexity30C35text