Glossary · Term

Algorithmic Lovelace Bound

← all terms

Definition

A formal limit on how much genuinely new information a self-referential system can add to its own outputs.

A Kolmogorov-complexity-based bound stating that a system applied recursively to its own outputs can add at most logarithmically many bits of genuine novelty beyond its initial conditions.

Mentioned in 1 episode

  1. 073
    When Three LLMs Talk to Each Other, Their Ideas Quietly Stop Moving