Computational intractability of attractors in the real quadratic family

DOI10.1016/J.AIM.2019.04.033MaRDI QIDQ2417754zbMATH OpenOpenAlexWikidataFDO

Authors 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

complexity lower boundsrenormalizationunimodal maps

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Dynamical systems involving maps of the interval (37E05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: We show that there exist real quadratic maps of the interval whose attractors are computationally intractable. This is the first known class of such natural examples.

Cites work

• Combinatorics, geometry and attractors of quasi-quadratic maps
• Complex a priori bounds revisited.
• Computability of Julia sets
• Dynamics and abstract computability: computing invariant measures
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 739000 (Why is no real title available?)
• Non-computable Julia sets
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the concept of attractor: correction and remarks
• On the dynamics of polynomial-like mappings
• Parabolic limits of renormalization
• Sensitive dependence to initial conditions for one dimensional maps

Cited in

(2)

• Towards understanding the theoretical challenges of numerical modeling of dynamical systems
• On the algorithmic descriptive complexity of attractors in topological dynamics

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

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