Next Article in Journal
Application of the EGM Method to a LED-Based Spotlight: A Constrained Pseudo-Optimization Design Process Based on the Analysis of the Local Entropy Generation Maps
Previous Article in Journal
On the Thermodynamics of Classical Micro-Canonical Systems
Article Menu

Export Article

Open AccessArticle
Entropy 2011, 13(6), 1200-1211; doi:10.3390/e13061200

Effective Complexity of Stationary Process Realizations

Max Planck Institute for Mathematics in the Sciences, Inselstr. 22, Leipzig 04103, Germany
Institute of Mathematics 7-2, Technical University Berlin, Straße des 17. Juni 136, Berlin 10623, Germany
Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA
Author to whom correspondence should be addressed.
Received: 8 May 2011 / Revised: 15 June 2011 / Accepted: 17 June 2011 / Published: 22 June 2011
View Full-Text   |   Download PDF [113 KB, uploaded 24 February 2015]


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, which is the probability distributions on finite binary strings. In our previous paper [1] 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 needs less parameters in its definition. A similar modification of the related concept of sophistication has been suggested by Antunes and Fortnow. View Full-Text
Keywords: effective complexity; Kolmogorov complexity; Shannon entropy; computable stationary processes; coarse effective complexity effective complexity; Kolmogorov complexity; Shannon entropy; computable stationary processes; coarse effective complexity
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Ay, N.; Müller, M.; Szkoła, A. Effective Complexity of Stationary Process Realizations. Entropy 2011, 13, 1200-1211.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top