Re:The $5000 Compression Challenge
by _hark on Monday November 25, 2024 @07:13AM
(#42235581)
Interesting. I guess then we would only be interested in the normalized complexity of infinite strings, e.g. lim n-> \infty K(X|n)/n where X is an infinite set of numbers (e.g. the decimal expansion of some real number), and K(X|n) is the complexity of the first n of them. This quantity should still be unique w/o reference to the choice of UTM, no?
[ Parent
| on HN ]
There are no comments on this comment yet.