<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>NP-complete Problems and Physical Reality · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_0502072/</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/quant-ph_0502072/feed.xml" rel="self" type="application/rss+xml" /><item><title>NP-complete Problems and Physical Reality — mentioned by hiddencost</title><link>https://news.ycombinator.com/item?id=37106950</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:37106950</guid><pubDate>Sun, 13 Aug 2023 05:27:14 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/quant-ph/0502072 Your comment reminded me of this classic of the genre. An extremely approachable read.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by ScottAaronson</title><link>https://news.ycombinator.com/item?id=17426686</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:17426686</guid><pubDate>Fri, 29 Jun 2018 18:48:22 GMT</pubDate><description>&lt;p&gt;Yup. :-) Or better yet, we could bifurcate into: (1) Why is our universe apparently unable to solve the halting problem for Turing machines? The answer, presumably, is a combination of the physical Church-Turing Thesis (specifically, the apparent impossibility of Turing-uncomputable processes in our world), with Church and Turing and Post&amp;#x27;s theorem on the unsolvability of the halting problem. Of course one could then push back and ask why the Church-Turing Thesis should be true of our world: i.e., why shouldn&amp;#x27;t there be physical &amp;quot;hypercomputers&amp;quot;? That&amp;#x27;s an enormous question, but my old survey…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by Rickasaurus</title><link>https://news.ycombinator.com/item?id=15095076</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:15095076</guid><pubDate>Thu, 24 Aug 2017 23:53:54 GMT</pubDate><description>&lt;p&gt;&amp;quot;NP-complete Problems and Physical Reality&amp;quot; by Scott Aaronson. It relates NP-complete problems to examples in nature. Excellent paper and a fun read. https://arxiv.org/abs/quant-ph/0502072&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — HN submission</title><link>https://news.ycombinator.com/item?id=13064547</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_0502072:13064547</guid><pubDate>Tue, 29 Nov 2016 17:37:01 GMT</pubDate><description>&lt;p&gt;NP-Complete Problems and Physical Reality (2005)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by jessedhillon</title><link>https://news.ycombinator.com/item?id=12892753</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:12892753</guid><pubDate>Mon, 07 Nov 2016 17:16:08 GMT</pubDate><description>&lt;p&gt;Direct PDF link for the lazy (e.g. me): https://arxiv.org/pdf/quant-ph/0502072v2.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by nabla9</title><link>https://news.ycombinator.com/item?id=12892188</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:12892188</guid><pubDate>Mon, 07 Nov 2016 16:18:01 GMT</pubDate><description>&lt;p&gt;I like Scott Aaronsons approach: Using NP hardness asumption as a physical constraint and seeing what follows. https://arxiv.org/abs/quant-ph/0502072&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by evanpw</title><link>https://news.ycombinator.com/item?id=10669933</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:10669933</guid><pubDate>Thu, 03 Dec 2015 15:13:24 GMT</pubDate><description>&lt;p&gt;Related (amazing) paper by Scott Aaronson: &amp;quot;NP-complete Problems and Physical Reality&amp;quot; (http://arxiv.org/abs/quant-ph/0502072). He proposes &amp;quot;anthropic computing&amp;quot; as a way of solving NP-complete problems in polynomial time: guess an answer, then kill yourself if the answer is wrong.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by chriswarbo</title><link>https://news.ycombinator.com/item?id=10546530</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:10546530</guid><pubDate>Wed, 11 Nov 2015 13:26:40 GMT</pubDate><description>&lt;p&gt;Reminds me of http://arxiv.org/abs/quant-ph/0502072 Also, as a Physicist and Computer Scientist, it explains my uneasiness when existence claims are made regarding infinite objects. For example, we can describe the trajectory of a particle using Feynman path integrals, which involve infinite sums over all possible paths. That&amp;#x27;s fine. Some will then treat this as a mechanism, i.e. claim that the reason particles have the trajectories they do, is because they literally are taking every possible path at once. This kind of reasoning sets my off my CS alarm bells, and articles like this provide…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by ColinWright</title><link>https://news.ycombinator.com/item?id=10074430</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:10074430</guid><pubDate>Mon, 17 Aug 2015 17:01:57 GMT</pubDate><description>&lt;p&gt;OK, it says this: For example, the Steiner Tree problem (STP) is known to be NP-complete ... Nonetheless, a simple physical process (termed an analog computation) can apparently solve it quickly. No, it can&amp;#x27;t. Small, trivial cases can be solved, but I believe it&amp;#x27;s been shown that when you get to mildly interesting cases it&amp;#x27;s just as likely to find non-optimal solutions, and sometimes even more likely to find non-optimal solutions. This is at the top of page 2, and it doesn&amp;#x27;t bode at all well. Section 3 of Aaronson&amp;#x27;s paper[0] discusses this explicitly, and comes to the conclusion that, not to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — HN submission</title><link>https://news.ycombinator.com/item?id=9883893</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_0502072:9883893</guid><pubDate>Tue, 14 Jul 2015 10:33:42 GMT</pubDate><description>&lt;p&gt;NP-Complete Problems and Physical Reality (2005)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;88 points; 33 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by ikeboy</title><link>https://news.ycombinator.com/item?id=9635124</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:9635124</guid><pubDate>Sun, 31 May 2015 18:54:44 GMT</pubDate><description>&lt;p&gt;See also NP-complete Problems and Physical Reality http://arxiv.org/abs/quant-ph/0502072&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — HN submission</title><link>https://news.ycombinator.com/item?id=9600713</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_0502072:9600713</guid><pubDate>Mon, 25 May 2015 16:49:54 GMT</pubDate><description>&lt;p&gt;NP-Complete Problems and Physical Reality (2005) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by weinzierl</title><link>https://news.ycombinator.com/item?id=9600704</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:9600704</guid><pubDate>Mon, 25 May 2015 16:48:21 GMT</pubDate><description>&lt;p&gt;This is a good follow up read to the classic &amp;quot;NP-complete Problems and Physical Reality&amp;quot;[1] and has not been discussed here. [1] http://arxiv.org/pdf/quant-ph/0502072v2.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — HN submission</title><link>https://news.ycombinator.com/item?id=8942220</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_0502072:8942220</guid><pubDate>Sun, 25 Jan 2015 06:30:11 GMT</pubDate><description>&lt;p&gt;NP-complete Problems and Physical Reality (2005)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;94 points; 16 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by jerf</title><link>https://news.ycombinator.com/item?id=3970749</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:3970749</guid><pubDate>Mon, 14 May 2012 12:34:13 GMT</pubDate><description>&lt;p&gt;Only for sufficiently small definitions of &amp;quot;solve&amp;quot;: http://arxiv.org/pdf/quant-ph/0502072v2 Definitions which turn out to be very small indeed.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — HN submission</title><link>https://news.ycombinator.com/item?id=3395601</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_0502072:3395601</guid><pubDate>Tue, 27 Dec 2011 12:43:01 GMT</pubDate><description>&lt;p&gt;NP Complete Problems and Physical Reality&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>NP-complete Problems and Physical Reality — mentioned by alextp</title><link>https://news.ycombinator.com/item?id=1586642</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_0502072:1586642</guid><pubDate>Mon, 09 Aug 2010 00:58:15 GMT</pubDate><description>&lt;p&gt;This paper http://arxiv.org/pdf/quant-ph/0502072 explores what it means for physical reality. It&amp;#x27;s really interesting. There are many possible scenarios, however. This blog post http://rjlipton.wordpress.com/2009/07/03/is-pnp-an-ill-posed... describes some of them.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_0502072/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
