Parabolic Julia sets are polynomial time computable
From MaRDI portal
Publication:5488814
DOI10.1088/0951-7715/19/6/009zbMath1190.37049arXivmath/0505036OpenAlexW3105366131WikidataQ123166434 ScholiaQ123166434MaRDI QIDQ5488814
Publication date: 25 September 2006
Published in: Nonlinearity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505036
Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Numerical problems in dynamical systems (65P99)
Related Items
Markov chains and generalized wavelet multiresolutions ⋮ Analysis of fractals, image compression, entropy encoding, Karhunen-Loève transforms ⋮ On the Complexity of Some Geometrical Objects ⋮ Statistical properties of dynamical systems -- Simulation and abstract computation ⋮ Real quadratic Julia sets can have arbitrarily high complexity ⋮ 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 ⋮ Unveiling the fractal structure of Julia sets with Lagrangian descriptors ⋮ Probability, statistics and computation in dynamical systems ⋮ On computational complexity of Siegel Julia sets ⋮ 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 ⋮ Computable Geometric Complex Analysis and Complex Dynamics
