Effective complexity is a
measure of complexity defined in a 1996 paper by
Murray Gell-Mann and
Seth Lloyd that attempts to measure the amount of non-
random information in a system. It has been criticised as being dependent on the subjective decisions made as to which parts of the information in the system are to be discounted as random.
See also
*
Kolmogorov complexity
*
Excess entropy
*
Logical depth
*
Renyi information
*
Self-dissimilarity
Self-dissimilarity is a measure of complexity defined in a series of papers by David Wolpert and William G. Macready.
The degrees of self-dissimilarity between the patterns of a system observed at various scales (e.g. the average matter density ...
*
Forecasting complexity Forecasting complexity is a measure of complexity put forward (under the original name of) by the physicist Peter Grassberger.
It was later renamed "statistical complexity" by James P. Crutchfield
James P. Crutchfield (born 1955) is an American m ...
References
External links
* http://www.cs.brandeis.edu/~pablo/complex.maker.html
Information theory
Computational complexity theory
Measures of complexity
{{Comp-sci-theory-stub