Open main menu

Effective complexity

Effective complexity is a measure of complexity defined in a 2003 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 alsoEdit

External linksEdit