<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>What does Newcomb's paradox teach us? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0904.2540/</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/0904.2540/feed.xml" rel="self" type="application/rss+xml" /><item><title>What does Newcomb's paradox teach us? — mentioned by djoldman</title><link>https://news.ycombinator.com/item?id=47350371</link><guid isPermaLink="false">urn:hackerpapers:mention:0904.2540:47350371</guid><pubDate>Thu, 12 Mar 2026 13:37:39 GMT</pubDate><description>&lt;p&gt;For folks reasoning through the &amp;quot;paradox,&amp;quot; this may be helpful: https://arxiv.org/pdf/0904.2540 Abstract: &amp;gt; ...We show that the conflicting recommendations in Newcomb’s scenario use different Bayes nets to relate your choice and the algorithm’s prediction. These two Bayes nets are incompatible. This resolves the paradox: the reason there appears to be two conflicting recommendations is that the specification of the underlying Bayes net is open to two, conflicting interpretations...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0904.2540/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item></channel></rss>
