@ Scott Aaronson. Re: your n-bits problem. You’re moving the goalposts. Your deterministic algorithm determines with 100% accuracy which situation is true. Your randomized algorithm only determines with “high probability” which situation is true. These are not the same outputs.
You need to establish goal with a fixed level of probability for the answer, and then compare a randomized algorithm to a deterministic algorithm that only answers to that same level of confidence.
That’s the same mistake that everyone always makes, when they say that “randomness provably does help.” It’s a cheaper way to solve a different goal. Hence, not comparable.
@ Scott Aaronson. Re: your n-bits problem. You’re moving the goalposts. Your deterministic algorithm determines with 100% accuracy which situation is true. Your randomized algorithm only determines with “high probability” which situation is true. These are not the same outputs.
You need to establish goal with a fixed level of probability for the answer, and then compare a randomized algorithm to a deterministic algorithm that only answers to that same level of confidence.
That’s the same mistake that everyone always makes, when they say that “randomness provably does help.” It’s a cheaper way to solve a different goal. Hence, not comparable.