Advanced Search
Article Contents
Article Contents

The algorithmic information content for randomly perturbed systems

Abstract Related Papers Cited by
  • 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 for the unperturbed system and are obtained using the notion of Algorithmic Information Content. The main result is an extension of known results to study time series obtained by the observation of real systems.
    Mathematics Subject Classification: 28D20, 37A50, 37M25, 60H40.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(66) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint