Recurrence and algorithmic information
C. Bonanno, S. Galatolo, S. Isola
Abstract
In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.
Create a lesson
Related papers
Limit cycles of singular algebraic foliations on the real projective plane
Tianwei Gan, Hongjin He, Dongmei Xiao
Quadratic Hubbard trees, automata, and ray connections
Eduardo Ventilari Sodré
Algorithmic Non-dimensionalisation of Polynomial Dynamical Systems with CRNNondim
Georgio Hawi, Martin Wechselberger
Statistical Stability and Linear Response for Suspension Measures under Base and Roof Perturbations
Aparna Rajput
Generating Forbidden Words and Measures of Maximal Entropy for Subshifts
Xinxing Wu, Xu Zhang
Large deviation of preimages of points under the dynamics of a holomorphic correspondence
Bharath Krishna Seshadri, Shrihari Sridharan