379 research outputs found
On computational complexity of Siegel Julia sets
It has been previously shown by two of the authors that some polynomial Julia
sets are algorithmically impossible to draw with arbitrary magnification. On
the other hand, for a large class of examples the problem of drawing a picture
has polynomial complexity. In this paper we demonstrate the existence of
computable quadratic Julia sets whose computational complexity is arbitrarily
high.Comment: Updated version, to appear in Commun. Math. Phy
Computability of Julia sets
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.Comment: Revised. To appear in Moscow Math. Journa
- …