arXiv Analytics

Sign in

arXiv:math/0610340 [math.DS]AbstractReferencesReviewsResources

Computability of Julia sets

Mark Braverman, Michael Yampolsky

Published 2006-10-10, updated 2007-09-29Version 2

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.

Comments: Revised. To appear in Moscow Math. Journal
Categories: math.DS
Subjects: 37F50
Related articles: Most relevant | Search more
arXiv:2305.00248 [math.DS] (Published 2023-04-29)
Open questions in descriptive set theory and dynamical systems
arXiv:2010.15386 [math.DS] (Published 2020-10-29)
Rays to renormalizations
arXiv:2012.00813 [math.DS] (Published 2020-12-01)
Subsums of Null Sequences: A Survey and Open Questions

Links

Toolbox