Alex said:
There is a difference between the determinism of an algorithm and the
predictability of the distribution of the numbers it produces...
Yes, true, but the existence of an algorithm that is shorter than the
resulting series does place the series in a different class -- unless, of
course, the algorithm cannot be found. This is how an engineer would say
it, anyway.
Also, I am assuming the user does not know where the starting point in
the sequence is.
That does put the question in a different light, unless infinite time is
available to perform tests. Given the latter, one could generate any number
of series and compare using a sliding window approach.
A real mathematician (which I am certainly not) would object on theoretical
grounds that if an algorithm exists that is shorter than the series, it is
child's play to find it. Well, infinite children, and infinite play.
/ ...
If you don't know the starting point in the sequence, knowing the
algorithm wouldn't matter - you have no idea when the sequence you see
will diverge from what might look like a 'familiar' sequence like
14159265358979.
See above, sliding window, infinite analysis time.
Unfortunately, this scheme wouldn't always work. For the computer to
guess the pi algorithm, you would have to
a) put in all the decimal places of pi (!)
b) leave the computer to run forever (!)
I agree, and I wasn't thinking of an infinite series above.
These requirements scupper the plan.... no matter how many qubits you
put in a quantuum computer, infinity still poses a problem.
Yes, quite.
/ ...
A well known rough test of how random information is: zip it up in
winzip. Now, I wonder what compression you get if you zip up a text file
containing places of pi?
I have done a lot of this as it turns out. Digits of Pi, e, etc, appear
quite random using this test, assuming the compression schemes are optimal
of course. Near the other end of the spectrum, plain-language text. And at
the far end of the spectrum, political speeches.
/ ...
Another digression:
I wonder what percentage of all possible permutations of information are
truly random and non-compressible?
But you used the word "information", so you have, perhaps inadvertently,
undermined your example. The set of stochastic processes is infinite, and
it is possible that the set of orderly proceses is also. Over time, entropy
turns some of the latter into the former.