Related (amazing) paper by Scott Aaronson: &quot;NP-complete Problems and Physical Reality&quot; (<a href="http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;quant-ph&#x2F;0502072" rel="nofollow">http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;quant-ph&#x2F;0502072</a>). He proposes &quot;anthropic computing&quot; as a way of solving NP-complete problems in polynomial time: guess an answer, then kill yourself if the answer is wrong.