Poly-time computability of the Feigenbaum Julia set

DOI10.1017/etds.2015.24zbMath1372.37094arXiv1404.1236OpenAlexW2291070285WikidataQ123349568 ScholiaQ123349568MaRDI QIDQ2976303

Michael Yampolsky, Artem Dudko

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

polynomialFeigenbaum mapcomputable Julia set

Mathematics Subject Classification ID

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

Related Items (7)

Real quadratic Julia sets can have arbitrarily high complexity ⋮ Computability of topological pressure on compact shift spaces beyond finite type* ⋮ On the Lebesgue measure of the Feigenbaum Julia set ⋮ Almost every real quadratic polynomial has a poly-time computable Julia set ⋮ On the computability of rotation sets and their entropies ⋮ On Lebesgue measure and Hausdorff dimension of Julia sets of real periodic points of renormalization ⋮ Computable Geometric Complex Analysis and Complex Dynamics

Cites Work

• Unnamed Item
• Filled Julia sets with empty interior are computable
• On computational complexity of Siegel Julia sets
• Feigenbaum-Coullet-Tresser universality and Milnor's hairiness conjecture
• Dynamics of quadratic polynomials. I, II
• Computability of the Julia set. Nonrecurrent critical orbits
• Fixed points of composition operators. II
• A computer-assisted proof of the Feigenbaum conjectures
• Geometry of the Feigenbaum map
• Renormalization and 3-Manifolds Which Fiber over the Circle
• Non-computable Julia sets
• Parabolic Julia sets are polynomial time computable
• On Computable Numbers, with an Application to the Entscheidungsproblem

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