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.
No takes yet. Share an insight, caveat, or question.
Braverman et al. (2008) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: