| ▲ | d_burfoot 6 hours ago | |
Kolmogorov Complexity is only defined up to a constant, which represents Turing machine translation length. | ||
| ▲ | notpushkin 15 minutes ago | parent [-] | |
I guess we need guesstimate the length of a shortest Turing machine implementation of amd64 then? | ||