3 ms·
You proved that not all outcomes are equiprobable, not that they're unbounded.
by klyrs 2y ago
You proved that not all outcomes are equiprobable, not that they're unbounded.
- LegionMammal978 2y agoThis is a proof by contradiction: it shows that any bounded algorithm doesn't have equally probable outputs, i.e., that it is necessarily biased, contradicting our assumption that it is unbiased. Therefore, an unbiased, bounded algorithm cannot exist (for n > 2): any algorithm is necessarily either biased or unbounded.