arXiv Analytics

Sign in

arXiv:1404.1236 [math.DS]AbstractReferencesReviewsResources

Poly-time Computability of the Feigenbaum Julia set

Artem Dudko, Michael Yampolsky

Published 2014-04-04Version 1

We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.

Categories: math.DS
Subjects: 37F25, 03D15
Related articles: Most relevant | Search more
arXiv:1712.08638 [math.DS] (Published 2017-12-22)
On the Lebesgue measure of the Feigenbaum Julia set
arXiv:math/9711216 [math.DS] (Published 1997-11-15, updated 1998-08-11)
Geometry of the Feigenbaum map
arXiv:math/0408290 [math.DS] (Published 2004-08-21)
Hausdorff dimension and conformal measures of Feigenbaum Julia sets

Links

Toolbox