Effective complexity: Difference between revisions

Content deleted Content added
No edit summary
Citation bot (talk | contribs)
m 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
Line 1:
{{notability|date=August 2012}}
 
'''Effective complexity''' is a [[Complex systems|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.<ref>https://philpapers.org/rec/GELIME</ref><ref>https://{{Cite journal |arxiv = 0810.org5663|doi = 10.1109/pdf/0810TIT.56632010.pdf2053892|title = Effective Complexity and Its Relation to Logical Depth|journal = IEEE Transactions on Information Theory|volume = 56|issue = 9|pages = 4593–4607|year = 2010|last1 = Ay|first1 = Nihat|last2 = Muller|first2 = Markus|last3 = Szkola|first3 = Arleta}}</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>https://philpapers.org/rec/MCAECA</ref>
 
== References ==