Algorithmic information for intermittent systems with an indifferent fixed point
| dc.creator | Bonanno, Claudio | |
| dc.creator | Galatolo, Stefano | |
| dc.date | 2004-03-03 | |
| dc.date.accessioned | 2026-07-07T05:05:54Z | |
| dc.date.available | 2026-07-07T05:05:54Z | |
| dc.description | 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. | |
| dc.description | 24 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/math/0403070 | |
| dc.identifier | http://arxiv.org/abs/math/0403070 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70344 | |
| dc.subject | Dynamical Systems | |
| dc.title | Algorithmic information for intermittent systems with an indifferent fixed point | |
| dc.type | text |