I remember Knuth goes quite detailed into this random-sequence thing in Volume 2.
My feeling is that it is more about "predictability": once a random sequence is generated, the randomness is gone and all you have is a sequence. The thing is that you should have no way to predict what sequence will be generated. If you put additional constraints (such as x 1's) then as soon as you have seen x 1's being generated, you know for sure that from then on only 0's will follow.
CountZero
"If you have four groups working on a compiler, you'll get a 4-pass compiler." - Conway's Law
In reply to Re: random elements with fixed totals
by CountZero
in thread random elements with fixed totals
by ysth
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |