[extropy-chat] A Quantum Computer on the market by 2008?

[scerir]

> Damien's friend comments: 
> This sounds completely screwy to me. Factoring large numbers is *easier*
> than the traveling salesman problem: the latter is NP-complete, while the
> factoring problem falls short of NP-completeness. 

Both issues (the NP-complete, and the supposed QC)
are discussed (with some humour) here
http://dabacon.org/pontiff/?p=954
(pontiff blog, 22 June)