Effective complexity
Effective complexity is a measure of complexity defined in a 2003 paper by Murray Gell-Mann and Seth Lloyd that attempts to measure the amount of non-random information in a system.[1] 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.[2]
References
See also
- Kolmogorov complexity
- Crude complexity
- Excess entropy
- Logical depth
- Total information
- Renyi information
- Self-dissimilarity
- Forecasting complexity
- Effective measure complexity
External links
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.