Effective Complexity and its Relation to Logical Depth

Abstract

Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information content. In this paper, we give a precise formal definition of effective complexity and rigorous proofs of its basic properties. In particular, we show that incompressible binary strings are effectively simple, and we prove the existence of strings that have effective complexity close to their lengths. Furthermore, we show that effective complexity is related to Bennett's logical depth: If the effective complexity of a string $x$ exceeds a certain explicit threshold then that string must have astronomically large depth; otherwise, the depth can be arbitrarily small.

14 pages, 2 figures

References in corpus (1)

• Effective complexity of stationary process realizations

Cited by in corpus (11)

• Complex systems approach to natural language
• Towards a Universal Measure of Complexity
• Natural Complexity, Computational Complexity and Depth
• Complexity distribution of agent policies
• Effective complexity of stationary process realizations
• An Algorithmic Approach to Emergence
• Sophistication vs Logical Depth
• The Observer Class Hypothesis
• Defining Pathway Assembly and Exploring its Applications
• Some comments on computational mechanics, complexity measures, and all that
• Relativity of Depth and Sophistication