<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Three Conjectures on Unexpectedeness · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2311.08768/</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/2311.08768/feed.xml" rel="self" type="application/rss+xml" /><item><title>Three Conjectures on Unexpectedeness — mentioned by Xmd5a</title><link>https://news.ycombinator.com/item?id=49272233</link><guid isPermaLink="false">urn:hackerpapers:mention:2311.08768:49272233</guid><pubDate>Wed, 12 Aug 2026 13:37:50 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2311.08768 &amp;gt;Three Conjectures on Unexpectedeness &amp;gt;Unexpectedness is a central concept in Simplicity Theory, a theory of cognition relating various inferential processes to the computation of Kolmogorov complexities, rather than probabilities. Its predictive power has been confirmed by several experiments with human subjects, yet its theoretical basis remains largely unexplored: why does it work? This paper lays the groundwork for three theoretical conjectures. First, unexpectedness can be seen as a generalization of Bayes&amp;#x27; rule. Second, the frequentist core of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2311.08768/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
