arXiv · math/0502354
On computational complexity of Siegel Julia sets
Abstract
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.
Explore related subjects
Keep this discovery
I. Binder, M. Braverman, M. Yampolsky. 2005-11-07. On computational complexity of Siegel Julia sets. https://doi.org/10.1007/s00220-006-1546-3
Cite the original work for its findings. Save a collection to share your selection of sources.