Effective complexity: Difference between revisions

Revision as of 12:26, 24 October 2009

Revision as of 12:40, 24 October 2009

Line 1:

{{orphan|date=October 2009}}

'''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.<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>

Line 13 ⟶ 15:

== External links ==

* http://www.cs.brandeis.edu/~pablo/complex.maker.html

{{math-stub}}

[[Category:Information theory]]

[[Category:Computational complexity theory]]

{{math-stub}}