3 ms·
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 by
by srcreigh 9mo ago
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 9mo agoKolmogorov Complexity is only defined up to a constant, which represents Turing machine translation length.
- notpushkin 9mo agoI guess we need to guesstimate the length of a shortest Turing machine implementation of amd64 then?
- srcreigh 9mo agoThis is cool. No need to guesstimate, it could be a world record category.
- Dylan16807 9mo agoThe 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.