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

d_burfoot • yesterday at 10:57 PM • 1 reply • view on HN

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

notpushkin • today at 4:28 AM

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

alt Hacker News