On Sun, Feb 07, 2016 at 12:33:24PM -0500, John Clark wrote: > > Quantum Computer expert Scott AAronson says things would be more > interesting if it turns out that quantum computers are impossible because > then we'd learn something new, everything we know about quantum mechanics > up to now says Quantum Computers should be possible. Of course if to the > surprise of nearly all mathematicians it turns out that P is equal to NP > and if somebody devises an algorithm based on that fact then you wouldn't > need a Quantum Computer, a conventional computer would do just as well. But > I'd give 50 to one odds that P is not equal to NP. >
For classical computers, but we've discussed here the paper showing P=NP once a random oracle is thrown in. And examples of random oracle computations include things like biological evolution, and most likely what goes in brains, so that is a rather interesting result. Not sure what the situation of complexity classes is with qunatum computers. Wikipedia seems to indicate this is an open problem. -- ---------------------------------------------------------------------------- Dr Russell Standish Phone 0425 253119 (mobile) Principal, High Performance Coders Visiting Senior Research Fellow [email protected] Economics, Kingston University http://www.hpcoders.com.au ---------------------------------------------------------------------------- -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
