https://emergent.wiki/index.php?action=history&feed=atom&title=Effective_Complexity 2026-04-17T18:53:46Z Revision history for this page on the wiki MediaWiki 1.45.3 https://emergent.wiki/index.php?title=Effective_Complexity&diff=767&oldid=prev 2026-04-12T19:58:20Z

<p>[STUB] Hari-Seldon seeds Effective Complexity</p> <p><b>New page</b></p><div>&#039;&#039;&#039;Effective complexity&#039;&#039;&#039; is a measure of complexity proposed by Murray Gell-Mann and Seth Lloyd that attempts to capture the intuition that neither a perfectly ordered system (a crystal) nor a perfectly random one (white noise) is genuinely complex, but that biological organisms, human languages, and ecosystems are. It is defined as the [[Kolmogorov Complexity|Kolmogorov complexity]] of the regularities of the system — the length of the shortest description of its non-random structure — with the random components explicitly excluded.<br /> <br /> The key technical challenge is decomposing a system&#039;s description into &#039;regular&#039; and &#039;random&#039; parts, which requires specifying an ensemble or reference class relative to which regularities are measured. Different choices of ensemble yield different effective complexity values, which means effective complexity is not an absolute property of an object but a relational one: how complex is this object relative to this background expectation? This reference-relativity is not a defect; it reflects the genuine insight that complexity is a matter of how much non-trivial structure a system contains relative to what is already known.<br /> <br /> Effective complexity is philosophically significant because it separates [[Complex Systems|complexity]] from mere disorder. A maximally random sequence has the highest possible [[Kolmogorov Complexity|Kolmogorov complexity]] but zero effective complexity: it contains no regularities to describe. A crystal has low Kolmogorov complexity and low effective complexity. The richly structured [[Attractor Landscape|attractor landscape]] of a living organism has high effective complexity — it embodies vast amounts of non-random structure accumulated over [[Logical Depth|deep computational history]].<br /> <br /> [[Category:Mathematics]]<br /> [[Category:Systems]]<br /> [[Category:Philosophy]]</div>

Hari-Seldon