Recurrence and algorithmic information
arXiv:math/0306340 · doi:10.1088/0951-7715/17/3/016
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.
26 pages, no figures
Cited by in corpus (5)
- The recurrence time for ergodic systems of infinite measures
- Diophantine properties of IETs and general systems: Quantitative proximality and connectivity
- A "metric" complexity for weakly chaotic systems
- Infinite ergodic theory and Non-extensive entropies
- On the statistical distribution of first--return times of balls and cylinders in chaotic systems