logoalt Hacker News

srcreighyesterday at 10:47 PM2 repliesview on HN

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.


Replies

Dylan16807today at 4:18 AM

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.

d_burfootyesterday at 10:57 PM

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

show 1 reply