Comment by d_burfoot
3 days ago
Kolmogorov Complexity is only defined up to a constant, which represents Turing machine translation length.
3 days ago
Kolmogorov Complexity is only defined up to a constant, which represents Turing machine translation length.
I guess we need to guesstimate the length of a shortest Turing machine implementation of amd64 then?
This is cool. No need to guesstimate, it could be a world record category.