Poly-time computability of the Feigenbaum Julia set

DOI10.1017/ETDS.2015.24MaRDI QIDQ2976303zbMATH OpenOpenAlexWikidataFDO

Authors Artem Dudko, Michael Yampolsky

Publication date 28 April 2017

Published in Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.1236

zbMATH Keywords

computable Julia setFeigenbaum mappolynomial

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75) Applications of computability and recursion theory (03D80) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Small divisors, rotation domains and linearization in holomorphic dynamics (37F50)

Abstract: 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.

Recommendations

• Computability of the Julia set. Nonrecurrent critical orbits
• Constructing non-computable Julia sets
• Almost every real quadratic polynomial has a poly-time computable Julia set
• Computability of Julia sets
• The computational complexity of some Julia sets

Cites work

• A computer-assisted proof of the Feigenbaum conjectures
• Computability of the Julia set. Nonrecurrent critical orbits
• Dynamics of quadratic polynomials. I, II
• Feigenbaum-Coullet-Tresser universality and Milnor's hairiness conjecture
• Filled Julia sets with empty interior are computable
• Fixed points of composition operators. II
• Geometry of the Feigenbaum map
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• Non-computable Julia sets
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On computational complexity of Siegel Julia sets
• Parabolic Julia sets are polynomial time computable
• Renormalization and 3-Manifolds Which Fiber over the Circle

Cited in

(10)

• Almost every real quadratic polynomial has a poly-time computable Julia set
• On the Lebesgue measure of the Feigenbaum Julia set
• Computability of the Julia set. Nonrecurrent critical orbits
• Real quadratic Julia sets can have arbitrarily high complexity
• Computing a solution of Feigenbaum's functional equation in polynomial time
• The computational complexity of some Julia sets
• On Lebesgue measure and Hausdorff dimension of Julia sets of real periodic points of renormalization
• Computable Geometric Complex Analysis and Complex Dynamics
• Computability of topological pressure on compact shift spaces beyond finite type*
• On the computability of rotation sets and their entropies

This page was built for publication: Poly-time computability of the Feigenbaum Julia set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976303)