Recurrence and algorithmic information

DOI10.1088/0951-7715/17/3/016zbMath1046.37006arXivmath/0306340OpenAlexW3101264125MaRDI QIDQ4812579

Stefano Galatolo, Claudio Bonanno, Stefano Isola

Publication date: 23 August 2004

Published in: Nonlinearity (Search for Journal in Brave)

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

zbMATH Keywords

entropyasymptotic behaviorHausdorff dimensioninvariant measureweakly chaotic dynamical systemsPoincaré recurrence theoremalgorithmic complexity of orbitsquantitative recurrence indicators

Mathematics Subject Classification ID

Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Measures of information, entropy (94A17) Dynamical systems involving maps of the interval (37E05) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20)

Related Items

Diophantine properties of iets and general systems: quantitative proximality and connectivity ⋮ Quantitative mixing results and inner functions ⋮ Quantitative recurrence for generic homeomorphisms ⋮ A Survey on the Dimension Theory in Dynamical Diophantine Approximation ⋮ Quantitative Uniform Hitting in Exponentially Mixing Systems ⋮ Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure ⋮ The dynamical Borel-Cantelli Lemma and the waiting time problems ⋮ ON THE STATISTICAL DISTRIBUTION OF FIRST-RETURN TIMES OF BALLS AND CYLINDERS IN CHAOTIC SYSTEMS ⋮ Hitting time and dimension in axiom A systems, generic interval exchanges and an application to Birkoff sums ⋮ Recurrence near given sets and the complexity of the Casati-Prosen map ⋮ The Rényi entropy function and the large deviation of short return times ⋮ Denoising signals corrupted by chaotic noise ⋮ A renormalization approach to irrational rotations ⋮ Long hitting times for expanding systems ⋮ “Metric” complexity for weakly chaotic systems