https://hackerpaper.kaipfister.de/p/cs_0203029/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=42703867urn:hackerpapers:mention:cs_0203029:42703867Tue, 14 Jan 2025 21:07:33 GMT<p>K(x) is the Kolmogorov complexity of x, i.e., the length of the shortest program that halts and outputs x, typically defined with respect to a universal Turing machine. I(x : y) = K(x) + K(y) - K(x, y) is the mutual algorithmic information of two strings. It is the algorithmic equivalent to Shannon&#x27;s mutual information. No algorithm f can increase the mutual algorithmic information between two strings, i.e. ∀f I(x : f(y)) ≤ I(x : y) + O(log(K(f))). I used &quot;data&quot; to denote any collection of interesting data at all. For example, it could be data obtained from the real world, the observed…</p><p><a href="https://hackerpaper.kaipfister.de/p/cs_0203029/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CChttps://news.ycombinator.com/item?id=39925562urn:hackerpapers:mention:cs_0203029:39925562Thu, 04 Apr 2024 01:29:29 GMT<p>Link to full paper: https://arxiv.org/pdf/cs/0203029.pdf</p><p><a href="https://hackerpaper.kaipfister.de/p/cs_0203029/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CC