The topic of this article may not meet Wikipedia's general notability guideline. (August 2012) (Learn how and when to remove this template message)
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. 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.
|P ≟ NP||This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.|