4 ms·
Kolmogorov Complexity is only defined up to a constant, which represents Turing machine translation length.
by d_burfoot 9mo ago
Kolmogorov 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.