Constructing non-computable Julia sets

DOI10.1145/1250790.1250893zbMATH Open1232.37024arXivmath/0604371OpenAlexW1998109216MaRDI QIDQ3549673FDOQ3549673

Authors: Mark Braverman, Michael Yampolsky 

Publication date: 5 January 2009

Published in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Abstract: We completely characterize the conformal radii of Siegel disks in the family ${\displaystyle }$P_ heta(z)=e^{2pi i heta}z+z^2,${\displaystyle }$ corresponding to {�f computable} parameters $heta$. As a consequence, we constructively produce quadratic polynomials with {�f non-computable} Julia sets.

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

Recommendations

• Non-computable Julia sets
• Computability of Julia sets
• Constructing locally connected non-computable Julia sets
• Real quadratic Julia sets can have arbitrarily high complexity
• Computability of the Julia set. Nonrecurrent critical orbits

zbMATH Keywords

quadratic polynomialsconstructive prooffilled Julia setsnon-computable Julia sets

Mathematics Subject Classification ID

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

Cited In (9)

• Computability of Julia sets
• Almost every real quadratic polynomial has a poly-time computable Julia set
• Tight space-noise tradeoffs in computing the ergodic measure
• Dimensions of Points in Self-similar Fractals
• Non-computable Julia sets
• Towards understanding the theoretical challenges of numerical modeling of dynamical systems
• Constructing locally connected non-computable Julia sets
• Filled Julia sets with empty interior are computable
• Computability of Julia sets

This page was built for publication: Constructing non-computable Julia sets

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