The upshot is that with forrelation equivalent to the BPQ problem a match
occurs with few oracles that with PH. An oracle is a sort of hypercomputing
system outside the Church-Turing thesis or λ-calculus. If BPQ requires
fewer oracle inputs it means it is a closer approximation to a
True, but as you mentioned, and we are in agreement this is a fundamentally new
class of problem. Whether it turns out to be of practical utility or remains as
an interesting oddball is yet to be determined.Chris
Sent from Yahoo Mail on Android
On Fri, Jun 22, 2018 at 1:42 PM, John Clark
On Thu, Jun 21, 2018 at 9:20 PM, 'Chris de Morsella' via Everything List <
everything-list@googlegroups.com> wrote:
>
> The birth of a fundamentally distinct new class of problems.
> BQP has carved out a realm of its own... beyond the reach of the combined
> set PH = {P, NP}
>
This new
The birth of a fundamentally distinct new class of problems.
BQP has carved out a realm of its own... beyond the reach of the combined set
PH = {P, NP}
Chris
On Thu, Jun 21, 2018 at 3:52 PM, Brent Meeker wrote:
Forwarded Message
4 matches
Mail list logo
