Filled Julia sets with empty interior are computable (Q941784)

Roughly speaking, a compact set in \(\mathbb C\) is computable if there exists a computer which can generate its image with arbitrarily precision. More precisely, a compact set is computable if it can be approximated as much as wanted in the Hausdorff metric by the union of finitely many balls with rational center and rational radius. In the paper under review the authors consider the computability of the filled Julia set of a polynomial \(P\). Those are the compact subsets of \(\mathbb C\) such that the orbits under the polynomial \(P\) are bounded. More in detail, an \textsl{oracle} is a machine which provides an approximation of any coefficient of the polynomial \(P\) with an arbitrarily high but finite requested precision. The main result of the paper is that for each \(d\geq 2\) there exists an oracle \(M^\varphi\) representing the coefficients of a polynomial \(P\) of degree \(d\) such that if the filled Julia set \(J_P\) of \(P\) has no interior then \(J_p\) is computable by \(M^\varphi\). Such a result is then extended to rational maps with no Siegel discs nor Herman rings. As an interesting corollary they finally prove that Julia sets of degree \(d\) rational maps with no Siegel discs nor Herman rings and no parabolic orbits depends continuously in the Hausdorff topology in \(\mathbb C\mathbb P^1\) on the parameters.