Almost every real quadratic polynomial has a poly-time computable Julia set
From MaRDI portal
Publication:1785010
DOI10.1007/s10208-017-9367-7zbMath1441.03032arXiv1702.05768OpenAlexW2624570007WikidataQ121187997 ScholiaQ121187997MaRDI QIDQ1785010
Artem Dudko, Michael Yampolsky
Publication date: 27 September 2018
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.05768
Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computation over the reals, computable analysis (03D78)
Related Items (4)
Real quadratic Julia sets can have arbitrarily high complexity ⋮ Computability of topological entropy: from general systems to transformations on Cantor sets and the interval ⋮ Towards understanding the theoretical challenges of numerical modeling of dynamical systems ⋮ Computable Geometric Complex Analysis and Complex Dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Equivalence and topological invariance of conditions for non-uniform hyperbolicity in the iteration of rational maps
- The Collet-Eckmann condition for rational functions on the Riemann sphere
- Statistical properties of unimodal maps: The quadratic family
- Computability of the Julia set. Nonrecurrent critical orbits
- Poly-time computability of the Feigenbaum Julia set
- Lyapunov Characteristic Exponents are Nonnegative
- On the transfer operator for rational functions on the Riemann sphere
- Non-computable Julia sets
- Parabolic Julia sets are polynomial time computable
This page was built for publication: Almost every real quadratic polynomial has a poly-time computable Julia set
