definition

Apparent complexity high only for structured intermediate strings

Apparent complexity, defined via coarse-graining then compression, is low both for a perfectly ordered string (e.g., a billion zeros, trivially compressible) and for a truly random string (whose coarse-grained averages are uniform), but high for an intermediate string that has structure yet is not fully ordered, because only such structure survives coarse-graining while resisting full compression.

definitionpending

Speaker

Sean Carroll

Evidence Quote

“The apparent complexity of a random number is low. The apparent complexity of a string of a billion zeros is low. The apparent complexity of an intermediate number that has some structure but is not completely random or completely ordered will be high.”

Source

320 | Solo: Complexity and the Universe— Sean Carroll's Mindscape
Created: 6/13/2026, 12:13:02 AM

Your notes

Loading notes...