Algorithmic information for intermittent systems with an indifferent fixed point

2004/03/03 by Claudio Bonanno, Stefano Galatolo, Bonanno, Claudio +1
Mathematics · #Dynamical Systems (math.DS) #FOS: Mathematics #math.DS

paper · pdf · doi:10.48550/arxiv.math/0403070

24 pages, 2 figures

arxiv created 2004/03/03 · arxiv updated 2009/12/01

Abstract

Measuring the average information that is necessary to describe the behaviour of a dynamical system leads to a generalization of the Kolmogorov-Sinai entropy. This is particularly interesting when the system has null entropy and the information increases less than linearly with respect to time. We consider two classes of maps of the interval with an indifferent fixed point at the origin and an infinite natural invariant measure. We calculate that the average information that is necessary to describe the behaviour of its orbits increases with time n approximately as n^α, where α<1 depends only on the asymptotic behaviour of the map near the origin.

Related

• The Algorithmic Information Content for randomly perturbed systems
• Dynamical systems and computable information
• Information, complexity and entropy: a new approach to theory and measurement methods
• Information, initial condition sensitivity and dimension in weakly\n chaotic dynamical systems
• The non-extensive version of the Kolmogorov-Sinai entropy at work