2 citations · 2 across the 3 of their papers we have counts for
Showing math.DSShow all
3 papers · 1 filter
math.DS2004
Algorithmic information for intermittent systems with an indifferent fixed point
Claudio Bonanno, Stefano Galatolo
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…
math.DS2003
The Algorithmic Information Content for randomly perturbed systems
Claudio Bonanno
In this paper we prove estimates on the behaviour of the Kolmogorov-Sinai entropy relative to a partition for randomly perturbed dynamical systems. Our estimates use the entropy fo…
math.DS2001
The Manneville map: topological, metric and algorithmic entropy
Claudio Bonanno
We study the Manneville map f(x)=x+x^z (mod 1), with z>1, from a computational point of view, studying the behaviour of the Algorithmic Information Content. In particular, we consi…