Filled Julia sets with empty interior are computable

DOI10.1007/S10208-005-0210-1zbMath1160.37013arXivmath/0410580OpenAlexW2035079758WikidataQ121576074 ScholiaQ121576074MaRDI QIDQ941784

Michael Yampolsky, Mark Braverman, Ilia A. Binder

Publication date: 2 September 2008

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

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

zbMATH Keywords

Julia setscomputabilityoracle

Mathematics Subject Classification ID

Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Statistical properties of dynamical systems -- Simulation and abstract computation ⋮ Computability of topological pressure on compact shift spaces beyond finite type* ⋮ Computability of the Julia set. Nonrecurrent critical orbits ⋮ Poly-time computability of the Feigenbaum Julia set ⋮ Computability of Brolin-Lyubich measure ⋮ On computational complexity of Cremer Julia sets ⋮ On computational complexity of Siegel Julia sets ⋮ Non computable Mandelbrot-like sets for a one-parameter complex family ⋮ Almost every real quadratic polynomial has a poly-time computable Julia set ⋮ On the computability of rotation sets and their entropies ⋮ Non-computable Julia sets ⋮ Constructing locally connected non-computable Julia sets ⋮ Non-computable impressions of computable external rays of quadratic polynomials ⋮ Computable Geometric Complex Analysis and Complex Dynamics

This page was built for publication: Filled Julia sets with empty interior are computable