Real quadratic Julia sets can have arbitrarily high complexity

DOI10.1007/s10208-020-09457-wOpenAlexW3016581423WikidataQ122861477 ScholiaQ122861477MaRDI QIDQ2658550

Cristobal Rojas, Michael Yampolsky

Publication date: 23 March 2021

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Julia setsrenormalizationunimodal mapscomplexity lower bounds

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Dynamical systems involving maps of the interval (37E05)

Related Items (1)

Computable Geometric Complex Analysis and Complex Dynamics

Cites Work

• On computational complexity of Siegel Julia sets
• Almost every real quadratic polynomial has a poly-time computable Julia set
• Complex a priori bounds revisited.
• Poly-time computability of the Feigenbaum Julia set
• Parabolic Julia sets are polynomial time computable
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Real quadratic Julia sets can have arbitrarily high complexity