>>>>> "Tim" == Tim Peters <tim.peters at gmail.com> writes: Tim> [Terry Jones] >> and which produces all permutations with equal probability) Tim> That needs proof. Assuming a true random number generator, such a Tim> proof is easy. Using a deterministic PRNG, if the period is "too Tim> short" it's dead easy (see below) to prove that it can't produce all Tim> permutations (let alone with equal probablility). OK, thanks. Sorry for the noise. Terry
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4