https://hackerpaper.kaipfister.de/p/1211.1302/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=17682583urn:hackerpapers:mention:1211.1302:17682583Fri, 03 Aug 2018 18:56:25 GMT<p>While what the author says is true (and I&#x27;m sure he knows vastly more about the subject than I do), I think the way that Kolmogorov complexity is described in the article is a bit misleading to a general audience. For short strings, we often can and do compute the Kolmogorov complexity. See some of Hector Zenil&#x27;s work, e.g. &quot;Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines&quot; (https://arxiv.org/abs/1211.1302). What &quot;uncomputable&quot; means is that for the general case, there cannot exist a program that is guaranteed to find the Kolmogorov complexity…</p><p><a href="https://hackerpaper.kaipfister.de/p/1211.1302/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.IT