The Blog of Scott Aaronson If you take just one piece of information from this blog: Quantum computers would not solve hard search problems instantaneously by simply trying all the possible solutions at once.
Read to the end — hat tip to Michael Nielsen. And this post is just to get into blogging stride again. More coming “soon.”
This entry was posted
on Tuesday, June 2nd, 2009 at 11:45 am and is filed under Complexity, Procrastination.
You can follow any responses to this entry through the RSS 2.0 feed.
Both comments and pings are currently closed.
6 Responses to “An unexpected application of the P vs. NP problem”
New Girl is pretty remarkable. What Alan Sokal could only do to cultural studies, she managed to do to to 1)Being a goth 2)Not being a goth 3)Being from Montreal 4) Having gone to a posh all-girls school in Montreal 4) Being a web developer.
Now encyclopedic knowledge of South Park you can’t fake.