The Algorithmic Information Content for randomly perturbed systems

Details The Algorithmic Information Content for randomly perturbed systems The Algorithmic Information Content for randomly perturbed systems

2003-09-29

arxiv.org/abs/math/0309462v1

Mathematics

Dynamical Systems

17 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Algorithmic Information Content for randomly perturbed systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Algorithmic Information Content for randomly perturbed systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Algorithmic Information Content for randomly perturbed systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370864