<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Solving satisfiability by Bayesian inference · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1205.6658/</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/1205.6658/feed.xml" rel="self" type="application/rss+xml" /><item><title>Solving satisfiability by Bayesian inference — HN submission</title><link>https://news.ycombinator.com/item?id=11306496</link><guid isPermaLink="false">urn:hackerpapers:submission:1205.6658:11306496</guid><pubDate>Thu, 17 Mar 2016 18:33:55 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve proved that p=np&lt;/p&gt;&lt;p&gt;http://arxiv.org/abs/1205.6658 ...and no one wants to/is able refute me.&lt;/p&gt;&lt;p&gt;2 points; 25 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1205.6658/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item><item><title>Solving satisfiability by Bayesian inference — mentioned by gizmo686</title><link>https://news.ycombinator.com/item?id=4954799</link><guid isPermaLink="false">urn:hackerpapers:mention:1205.6658:4954799</guid><pubDate>Fri, 21 Dec 2012 22:16:25 GMT</pubDate><description>&lt;p&gt;When I opened this page, I was going to be the third comment, then I got caught up trying to explain why their linked paper [1] (proving P=NP) is non-sense. Unfourtuantly, my habit of assuming that my not understanding something just means that I need to re-read it or play with that segment of the proof myself costed me more time than I thought (even after I wrote in my partially completed reply that the introduction alone was sufficient to dismiss the paper as nonsense). Anyway, here is my overkill analysis: I would be highly skeptical of their claim. First of all, if they did prove P=NP…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1205.6658/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item><item><title>Solving satisfiability by Bayesian inference — mentioned by bzax</title><link>https://news.ycombinator.com/item?id=4954612</link><guid isPermaLink="false">urn:hackerpapers:mention:1205.6658:4954612</guid><pubDate>Fri, 21 Dec 2012 21:33:12 GMT</pubDate><description>&lt;p&gt;You might as well start with his proof of P=NP http://arxiv.org/pdf/1205.6658.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1205.6658/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
