Effective complexity: Difference between revisions

Revision as of 17:27, 4 August 2012

Revision as of 17:48, 4 August 2012

Line 1:

{{notability|date=August 2012}}

'''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.<ref>http://www.santafe.edu/research/publications/workingpapers/03-12-068.pdf</ref> 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.<ref>http://cat.inist.fr/?aModele=afficheN&cpsidt=14976916</ref>