----- Original Message -----
From: "Jesse Mazer" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, December 30, 2002 11:40 AM
Subject: Re: Quantum Probability and Decision Theory
> Stephen Paul King wrote:
> >Dear Jesse,
> > Please read the below referenced paper. It shows that QM comp *CAN*
> >"solve an undecidable problem"
> > (relative to a classical computer)."
> Where does it say that?
In the abstract of http://www.cs.auckland.ac.nz/~cristian/coinsQIP.pdf
Please read this paper. It explains the basis of my claim.
> >I do not see how I misread Feynman's
> Again, the paper says:
> "Is there any hope for quantum computing to challenge the Turing barrier,
> i.e., to solve an undecidable problem, to compute an uncomputable
> According to Feynman's argument ... the answer is negative."
> That seems pretty clear to me--if the answer is negative, that means there
> is *not* "any hope for quantum computing to challenge the Turing barrier".
> Do you understand "negative" to mean something different?
Perhaps we should consider that our dear Mr. Feynman did not fully
appreciate his own idea. ;-)