Re:The Machine of Tomorrow Today: Quantum Computing on the V...
by Rusky on Wednesday June 14, 2017 @06:45PM
(#14556662)
It's nondeterministic in the same sense as the "nondeterministic polynomial" of P = NP. Basically, a normal turing machine would also be a nondeterminisic one if P = NP.
[ Parent
| on HN ]
There are no comments on this comment yet.