[ExI] Stross on alleged NP-complete solution

[Eliezer S. Yudkowsky]

It uses superexponential computing power, N^N photons.  There's no 
reason you can't solve an NP-complete problem with superexponential 
computing power.  It won't scale to factoring large composites because 
you'd need vastly more photons than the mass-energy of the visible 
universe.

-- 
Eliezer S. Yudkowsky                          http://singinst.org/
Research Fellow, Singularity Institute for Artificial Intelligence