Computability of the Julia set. Nonrecurrent critical orbits

DOI10.3934/dcds.2014.34.2751zbMath1343.37033arXiv1109.2946OpenAlexW2033463377MaRDI QIDQ2438692

Artem Dudko

Publication date: 6 March 2014

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitycritical pointJulia setTuring machinecomputabilityoracleparabolic periodic orbit

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) 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)

Related Items (4)

Computability of topological pressure on compact shift spaces beyond finite type* ⋮ Poly-time computability 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

Cites Work

• Computability of Julia sets
• Filled Julia sets with empty interior are computable
• On computational complexity of Siegel Julia sets
• Constructing locally connected non-computable Julia sets
• Generic hyperbolicity in the logistic family
• Dynamics of quadratic polynomials. I, II
• The Collet-Eckmann condition for rational functions on the Riemann sphere
• Statistical properties of unimodal maps: The quadratic family
• On a theorem of Fatou
• Non-computable Julia sets
• Parabolic Julia sets are polynomial time computable
• Dynamics in One Complex Variable. (AM-160)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computability of the Julia set. Nonrecurrent critical orbits