Comment by srcreigh

Comment by srcreigh 17 hours ago

3 replies

As an aside, I wonder how to account for the information content embedded in the hardware itself.

A Turing Machine compressor program would likely have more bytes than the amd64 binary. So how to evaluate KolmogorovComplexity(amd64)?

The laws of physics somehow need to be accounted for too, probably.

d_burfoot 17 hours ago

Kolmogorov Complexity is only defined up to a constant, which represents Turing machine translation length.

  • notpushkin 11 hours ago

    I guess we need to guesstimate the length of a shortest Turing machine implementation of amd64 then?

Dylan16807 12 hours ago

The complexity of a simple turing machine is itty bitty, and you can bootstrap that into an x86 emulator in a matter of kilobytes, so when we're messing with 100MB files it's not a big factor.