Damien Miller's weblog

I just finished reading Scott Aaronson's NP-complete Problems and Physical Reality (also known as quant-ph/0502072). With excellent humor, Aaronson dicusses various comptational models ranging from the merely strange (Soap bubbles and quantum computers) to the completely wacky (Anthropic computing, where you kill yourself if you don't get the right answer). He makes a case that the hardness of NP problems should be considered as a physical principle, with interesting predicive consequences.

posted at: 16:28 | path: /readings | permanent link