Computational intractability of attractors in the real quadratic family

DOI10.1016/j.aim.2019.04.033zbMath1422.68094arXiv1703.04660OpenAlexW2962952505WikidataQ128021437 ScholiaQ128021437MaRDI QIDQ2417754

Cristobal Rojas, Michael Yampolsky

Publication date: 29 May 2019

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

renormalizationunimodal 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) Computation over the reals, computable analysis (03D78)

Related Items (1)

Towards understanding the theoretical challenges of numerical modeling of dynamical systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamics and abstract computability: computing invariant measures
• On the concept of attractor: correction and remarks
• Sensitive dependence to initial conditions for one dimensional maps
• Combinatorics, geometry and attractors of quasi-quadratic maps
• Complex a priori bounds revisited.
• On the dynamics of polynomial-like mappings
• Parabolic limits of renormalization
• Non-computable Julia sets
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Computational intractability of attractors in the real quadratic family