Re:Kolmogorov Complexity – A Primer (2012)
by mafribe on Monday October 03, 2016 @02:46AM
(#12625787)
What you need to do is produce a programming language L such that the existence of incompressibility of strings becomes false, e.g. contradict Theorem 2.2.1 of Li & Vitanyi.
[ Parent
| on HN ]
There are no comments on this comment yet.