Tag: Specified Complexity Made Simple (series)
Orgelian Specified Complexity
I have presented Orgel’s account of specified complexity so readers can decide which they prefer, Orgel’s or the one described in this series.
Specified Complexity and a Tale of Ten Malibus
The validity of these estimates and the degree to which they can be refined can be disputed. But the underlying formalism of specified complexity is rock solid.
Specified Complexity as a Unified Information Measure
The most important take away here is that specified complexity makes Shannon information and Kolmogorov information commensurable.
Shannon and Kolmogorov Information
There’s a deep connection between probability and complexity. This connection is made clear in Shannon’s theory of information.
Intuitive Specified Complexity: A User-Friendly Account
At this early stage in the discussion, however, it seems wise to lay out specified complexity in a convenient non-technical way.