Apparent Complexity
Definition
A measure of complexity that coarse-grains a system and then measures the algorithmic compressibility of the result. It is low for both perfectly ordered and fully random configurations and high for structured intermediate states, capturing the intuitive sense that complexity lives between order and randomness.
Cast within
No topic-region cast yet — this appears once Apparent Complexity's compiled claims are aligned into a topic region's argument tree.
Claims mentioning Apparent Complexity (0)
No claims found for this concept.
My Notes
Loading notes...