Algorithmic Simplicity

Definition

Measuring the simplicity of a theory by the brevity of its mathematical description (its algorithmic/description length) rather than by the amount of physical stuff it posits.

Cast within

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

Claims mentioning Algorithmic Simplicity (1)

Your notes

Loading notes...