Effective complexity of stationary process realizations

Details Effective complexity of stationary process realizations Effective complexity of stationary process realizations

2010-01-15

arxiv.org/abs/1001.2686v2

Computer Science

Information Theory

14 pages, no figures

Scientific paper

The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by means of ensembles, that is probability distributions on finite binary strings. In our previous paper we propose a definition of effective complexity in precise terms of algorithmic information theory. Here we investigate the effective complexity of binary strings generated by stationary, in general not computable, processes. We show that under not too strong conditions long typical process realizations are effectively simple. Our results become most transparent in the context of coarse effective complexity which is a modification of the original notion of effective complexity that uses less parameters in its definition. A similar modification of the related concept of sophistication has been suggested by Antunes and Fortnow.

Affiliated with

Also associated with

No associations

Rating

Effective complexity of stationary process realizations 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 Effective complexity of stationary process realizations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective complexity of stationary process realizations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357681