factual

Kolmogorov complexity drops sharply at the transition

The phase transition can be measured by approximating the Kolmogorov complexity of the soup via compression: initially random bytes are incompressible (gas-like), but once replicators appear the soup becomes far more compressible because many tapes are pasted-together parts of other tapes, so complexity drops dramatically as the system shifts from an incompressible Turing gas to a structured computational phase.

factualpending

Speaker

Blaise Agüera Y Arcas

Evidence Quote

“you take the all the bytes in the soup and you think about it as a file and you zip it, and then you take the ratio of the zipped file size to the original. That gives you a sense of how compressible it is.”

Source

286 | Blaise Agüera y Arcas on the Emergence of Replication and Computation— Sean Carroll's Mindscape
Created: 6/13/2026, 12:23:48 AM

Your notes

Loading notes...