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?
Again, the paper says:I do not see how I misread Feynman's claim
"Is there any hope for quantum computing to challenge the Turing barrier, i.e., to solve an undecidable problem, to compute an uncomputable function? 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?
Jesse
_________________________________________________________________
MSN 8 limited-time offer: Join now and get 3 months FREE*. http://join.msn.com/?page=dept/dialup&xAPID=42&PS=47575&PI=7324&DI=7474&SU= http://www.hotmail.msn.com/cgi-bin/getmsg&HL=1216hotmailtaglines_newmsn8ishere_3mf
