Jump to content

Effective complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by The Anome (talk | contribs) at 12:22, 24 October 2009 (* Kolmogorov complexity). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Effective complexity is a concept 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]

See also

References

  1. ^ http://www.santafe.edu/research/publications/workingpapers/03-12-068.pdf
  2. ^ http://cat.inist.fr/?aModele=afficheN&cpsidt=14976916
Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Effective_complexity&oldid=321745759"