Even if P=BPP, that just means that giving up randomness causes “only” a polynomial slowdown instead of an exponential one, and in practice we’ll still need to use pseudorandom generators to simulate randomness.
It seems clear to me that noise (in the sense of randomized algorithms) does have power, but perhaps we need to develop better intuitions as to why that is the case.
Even if P=BPP, that just means that giving up randomness causes “only” a polynomial slowdown instead of an exponential one, and in practice we’ll still need to use pseudorandom generators to simulate randomness.
It seems clear to me that noise (in the sense of randomized algorithms) does have power, but perhaps we need to develop better intuitions as to why that is the case.