Effective complexity as a measure of information content
Philosophy of Science 70 (2):302-307 (2003)
| Abstract | Murray Gell-Mann has proposed the concept of effective complexity as a measure of information content. The effective complexity of a string of digits is defined as the algorithmic complexity of the regular component of the string. This paper argues that the effective complexity of a given string is not uniquely determined. The effective complexity of a string admitting a physical interpretation, such as an empirical data set, depends on the cognitive and practical interests of investigators. The effective complexity of a string as a purely formal construct, lacking a physical interpretation, is either close to zero, or equal to the string's algorithmic complexity, or arbitrary, depending on the auxiliary criterion chosen to pick out the regular component of the string. Because of this flaw, the concept of effective complexity is unsuitable as a measure of information content. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesSteven Weinstein (2003). Objectivity, Information, and Maxwell's Demon. Philosophy of Science 70 (5):1245-1255.
Steven Weinstein (2003). Objectivity, Information, and Maxwell's Demon. Philosophy of Science 70 (5):1245-1255.
Luca Anderlini & Leonardo Felli (1999). Incomplete Contracts and Complexity Costs. Theory and Decision 46 (1):23-50.
Peter D. Grünwald & Paul M. B. Vitányi (2003). Kolmogorov Complexity and Information Theory. With an Interpretation in Terms of Questions and Answers. Journal of Logic, Language and Information 12 (4):497-529.
W. J. (2003). Algorithmic Randomness in Empirical Data. Studies in History and Philosophy of Science Part A 34 (3):633-646.
Graeme S. Halford, William H. Wilson & Steven Phillips (1998). Relational Complexity Metric is Effective When Assessments Are Based on Actual Cognitive Processes. Behavioral and Brain Sciences 21 (6):848-860.
W. Bentley MacLeod (1998). Is Multi-Tasking Complex? Behavioral and Brain Sciences 21 (6):840-841.
Peter Jedlicka (2007). Physical Complexity and Cognitive Evolution. In Carlos Gershenson, Diederik Aerts & Bruce Edmonds (eds.), Worldviews, Science, and Us: Philosophy and Complexity. World Scientific.
Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2).
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads20 ( #61,442 of 548,984 )Recent downloads (6 months)3 ( #25,729 of 548,984 )How can I increase my downloads? |
My notes
Discussion
