The algorithmic information content for randomly perturbed systems (Q1884250)

The aim of the present paper is to investigate estimates on the behaviour of the Kolmogorov-Sinai entropy relative to partition for randomly perturbed dynamical systems by some noise by using the entropy of the unperturbed system and a method introduced by \textit{F. Argenti, V. Benci, P. Cerrai, A. Cordelli, S. Gatacolo} and \textit{M. Menconi} [Chaos Solitons Fractals 13, 461--469 (2002; Zbl 1001.37013)] and by \textit{V. Benci, C. Bonanno, S. Galatolo, G. Menconi} and \textit{M. Virgilio} [Discrete Contin. Dyn. Syst., Ser. B 4, 935--960 (2004; Zbl 1058.94512)], related to the notion of Algorithmic Information Content (AIC). The main objective of the author's research is an extension of known results to study time series obtained by the observation of real systems (see equations (14) and (15) in subsection 5.3.).