top | item 46595358

(no title)

d_burfoot | 1 month ago

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

discuss

order

notpushkin|1 month ago

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

srcreigh|1 month ago

This is cool. No need to guesstimate, it could be a world record category.