2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/138883In 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.Revised. To appear in Moscow Math. JournalDynamical Systems37F50text