Re: Randomness
- From: Matthias Klaey <mpky@xxxxxxxxxxx>
- Date: Sun, 03 Sep 2006 03:42:30 +0200
"Matt Zellman" <matt.zellman@xxxxxxxxx> wrote:
mensanator@xxxxxxxxxxx wrote:
Matt Zellman wrote:
are the following string of digits random?
Not likely.
I suppose that was kind of a stupid question. Are they random by some
definition of random? and if so, what definition?
0101000000000000000000000000000010000100100000000110001000000000
0000110110111110001010100010011100110011011011011001100110100110
1101110011101111010000001101011100000111101111111101000110100110
0000000000000000000000000100000000010000000001000000000000001000
1010110100111010011010100010011001100010011010010001100100100110
1010100111100001010110111101000100001000010100101001000001011100
here's a better question. Could the preceding six strings of digits
conceivably be randomly generated?
Sure.
This question somehow reminds me of a theorem that I heard of, but
never actually seen: "For any given set of data there is a test such
that the data will pass the test" (or converse, "such that the data
will fail the test/such that the null hypothesis is rejected")
I believe it is attributed to Kolmogorov.
Does anyone know something more precise about this?
And Matt, by this theorem the answer to your firts question is "yes".
For the second: I have no idea. The best reference I can give you is
D.E.Knuth, The Art of Computer Programming, Volume 2, Chapter 3, Third
Edition, Addison-Wesley 1998, ISBN 0-201-89684-2. There you may learn
more about random sequences than you ever wanted to know :)
Greetings, Matthias Kläy
.
- Follow-Ups:
- Re: Randomness
- From: Matt Zellman
- Re: Randomness
- References:
- Re: Randomness
- From: mensanator@xxxxxxxxxxx
- Re: Randomness
- From: Matt Zellman
- Re: Randomness
- Prev by Date: Re: I have a paper on graph coloring
- Next by Date: Re: [] A graph theory terminology challenge
- Previous by thread: Re: Randomness
- Next by thread: Re: Randomness
- Index(es):