|
|
|
|
|
|
|
|
CTK Exchange
Arturo
guest
|
Oct-16-09, 03:37 PM (EST) |
|
"Random Riddle"
|
A typical example of a random sequence of 0s and 1s (of length n, say) is one that is obtained by repeated tossings of a fair coin, with "heads" and "tails" representing 1 and 0, respectively. Now, if every n-binary sequence can, in principle, be obtained by this procedure, then all n-binary sequences are random, including such sequences as 01010101010...01 which obey a precise rule. But on the other hand, if certain sequences can never be so obtained, then it's not true that the probability of obtaining any one of the 2^n sequences is 1/2^n--which contradicts a basic assumption of theoretical probability. In either case, we seem to reach a conclusion that must be rejected. Can you explain a "way out" of this paradox? Yours sincerely, --Arturo
|
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
alexb
Charter Member
2451 posts |
Oct-16-09, 03:47 PM (EST) |
|
1. "RE: Random Riddle"
In response to message #0
|
The paradox is entirely semantic. The word "random" is used in two distinct ways. 1. A sequence is random if it has been created by a random process, or might have been. 2. A sequence is random if it looks disorderly, i.e. random. Any sequence is random in the first sense whether it looks random (in the second sense) or not. Even of a sequence appears to follow a certain rule, it does not mean that it might not be the result of a stochastic process. The apparent paradox brings to mind Solomon Golomb's syllogism: All governments are unjust. To prove the assertion for all governments, it is sufficient to prove it for an arbitrary government. If a government is arbitrary, it is obviously unjust. And since this is true for an arbitrary government, it is true for all governments.
|
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
You may be curious to have a look at the old CTK Exchange archive. Please do not post there.
Copyright © 1996-2018 Alexander Bogomolny
|
|