GUT and NP

James A. Donald jamesd at netcom.com
Wed Jul 27 16:06:19 PDT 1994


Ray Cromwell writes
 >   And regardless of whether quantum computers work or not, they are
 > still algorithmic if they can be simulated (however slowly) by
 > a turing machine. It's a rigorous mathematical definition.

I think this is a misquote of the definition.

If a turing machine can *perform* it, then it is an algorithm.

Since a turing machine certainly cannot perform quantum
"algorithms", then by definition they are not algorithms.

-- 
 ---------------------------------------------------------------------
We have the right to defend ourselves and our
property, because of the kind of animals that we              James A. Donald
are.  True law derives from this right, not from
the arbitrary power of the omnipotent state.                jamesd at netcom.com






More information about the cypherpunks-legacy mailing list