Jump to content

Effective complexity

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BattyBot (talk | contribs) at 21:48, 31 May 2021 (Moved See also above References per MOS:ORDER and other General fixes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Effective complexity" – news · newspapers · books · scholar · JSTOR (August 2012) (Learn how and when to remove this message)

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]

See also

References

^ https://philpapers.org/rec/GELIME
^ 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.
^ https://philpapers.org/rec/MCAECA

External links

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

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=1026187894"

Hidden categories: