{"id":302,"date":"2006-08-27T11:36:15","date_gmt":"2006-08-27T15:36:15","guid":{"rendered":"https:\/\/www.goer.org\/wordpress\/death_by_algorithm"},"modified":"2006-08-27T11:36:15","modified_gmt":"2006-08-27T15:36:15","slug":"death_by_algorithm","status":"publish","type":"post","link":"https:\/\/www.goer.org\/Journal\/2006\/08\/death_by_algorithm.html","title":{"rendered":"Death by Algorithm!"},"content":{"rendered":"

My old college buddy Dinesh pointed me to the blog of a company, D-Wave, that is trying to make quantum computers commercially available<\/a>. That statement alone nearly triggered my brain’s Quantum Computing Bullshit Detection Nodule,[1<\/a>]<\/sup> but Dinesh says that he’s met some of the employees and he thinks they might be the real deal. They’re trying out an alternative approach to quantum computing called adiabatic quantum computing<\/a>, which they believe is more likely to meet with success than the “traditional” approach. It’s a hard problem, and I wish them luck.<\/p>\n

Linked from the D-Wave blog, there’s an interesting paper on arXiv<\/a> called “NP-Complete Problems and Physical Reality”<\/a> [PDF]. It’s a more layperson-friendly piece than your average physics journal article, but I still only understood a small fraction of it. This math-y stuff is getting harder every year. Still, I thought it explored some fascinating, if somewhat deranged, physical concepts. I particularly liked the discussion of time-travel computing and its close relation, “anthropic computing”:<\/p>\n

\n

“There is at least one foolproof way to solve 3SAT<\/a> in polynomial time: given a formula phi<\/var>, guess a random assignment x<\/var>, then kill yourself if x<\/var> does not satisfy phi<\/var>. Conditioned on looking at anything at all, you will be looking at a satisfying assignment! Some would argue that this algorithm works even better if we assume the many-worlds interpretation of quantum mechanics. For according to that interpretation, with probability 1, there really is a universe in which you guess a satisfying assignment and therefore remain alive. Admittedly, if phi<\/var> is unsatisfiable, you might be out of luck…”<\/p>\n<\/blockquote>\n

<\/a>1. Conveniently nestled against the larger and more highly evolved Nanotech Bullshit Detection Nodule.<\/small><\/p>\n","protected":false},"excerpt":{"rendered":"

“There is at least one foolproof way to solve 3SAT<\/a> in polynomial time: given a formula phi<\/var>, guess a random assignment x<\/var>, then kill yourself if x<\/var> does not satisfy phi<\/var>…”<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[10],"tags":[],"class_list":["post-302","post","type-post","status-publish","format-standard","hentry","category-science"],"_links":{"self":[{"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/posts\/302","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/comments?post=302"}],"version-history":[{"count":0,"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/posts\/302\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/media?parent=302"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/categories?post=302"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.goer.org\/Journal\/wp-json\/wp\/v2\/tags?post=302"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}