Computability of Julia Sets
Mark Braverman, Michael Yampolsky · Moscow Mathematical Journal · 2008
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.