<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_9901014/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_9901014/feed.xml" rel="self" type="application/rss+xml" /><item><title>Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity — mentioned by pdkl95</title><link>https://news.ycombinator.com/item?id=9716445</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_9901014:9716445</guid><pubDate>Sun, 14 Jun 2015 21:48:25 GMT</pubDate><description>&lt;p&gt;You may want to read this paper: &amp;quot;Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity&amp;quot; (Paul Vitanyi, Ming Li) http://arxiv.org/abs/cs/9901014&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_9901014/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
