Jump to content

Effective complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 19:39, 2 July 2019 (Alter: template type. Add: year, pages, issue, volume, journal, title, doi, arxiv, author pars. 1-3. Removed URL that duplicated unique identifier. Converted bare reference to cite template. Formatted dashes. | You can use this bot yourself. Report bugs here.| Activated by User:Headbomb). 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. ^ Ay, Nihat; Muller, Markus; Szkola, Arleta (2010). "Effective Complexity and Its Relation to Logical Depth". IEEE Transactions on Information Theory. 56 (9): 4593–4607. arXiv:0810.5663. doi:10.1109/TIT.2010.2053892.
  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=904527542"