Jump to content

Effective complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 100.1.148.211 (talk) at 03:03, 10 March 2019. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Effective complexity is a measure of complexity defined in a 1996 paper by Murray Gell-Mann and Seth Lloyd that attempts to measure the amount of non-random information in a system.[1][2] 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.[3]

References

  1. ^ https://philpapers.org/rec/GELIME
  2. ^ https://arxiv.org/pdf/0810.5663.pdf
  3. ^ https://philpapers.org/rec/MCAECA

See also

P ≟ NP 

This theoretical computer science–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=887024097"