On Sun, Feb 7, 2016 Russell Standish <[email protected]> wrote: > > we've discussed here the paper showing > > P=NP once a random oracle is thrown in.
The trouble with a proof like that is that even if you have a r andom oracle there is no way to prove it's a random oracle . > > > Not sure what the situation of complexity classes is with qunatum > computers. Nobody knows, all we know for certain is that quantum algorithms have been found that can solve problems MUCH faster than the best known conventional algorithms, but there is no proof that a equally good conventional algorithm won't be found tomorrow, although I'd be astonished if it were. John K Clark -- 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.
