Algorithmic Complexity Horizon

Definition

The idea, from Chaitin's complexity-based proof of incompleteness, that a logical system cannot produce results more complex than its axioms ('10 pounds of theorems from 5 pounds of axioms'), so truths beyond its complexity are unprovable.

Cast within

No topic-region cast yet — this appears once Algorithmic Complexity Horizon's compiled claims are aligned into a topic region's argument tree.

Claims mentioning Algorithmic Complexity Horizon (1)

Your notes

Loading notes...