Re: Pi as the Mother Number




"Jim Black" <tramspap@xxxxxxxxx> wrote

Let's say you have a string of up to 100 digits, chosen at random.
There are 10^100+10^99+10^98+... = 1.111....*10^100 possible strings.
Now suppose you run them through some sort of compression algorithm.
The compression algorithm outputs a string of digits which you could
uncompress if you wanted the original string of digits back. There
must therefore be at least 1.111...*10^100 possible output strings, or
the compression would not be reversible. Since we want to make the
output strings as short as possible, we wouldn't use a 101-digit string
as a possible output if there was an string of 100 digits or fewer that
wasn't being used to represent something else. Thus, we will end up
using all 1.111...*10^100 possible 100-digit-or-fewer strings as
outputs. So the average length of a string after compression will be
the same as the average length of a string before compression.

The reason that compression works, despite this argument, is that not
all inputs are equally probable. For example, for a program designed
to compress text, the input "Have a nice day" is much more probable
than the input "dkjrc4jg5ghd3bv" is. But if the input is random, i.e.,
all inputs are equally likely, then compression is impossible.

I totally agree with your analysis. I never imagined that it would
be possible to compress _most_ random numbers by finding them in pi
and then if necessary compressing the index into pi -- my only point is
that it would be possible to compress a SUBSET of what would otherwise
appear to be random incompressible numbers by these means. I think this is
quite consistent with your formulation. You talk about the "average
length" of a string after compression. I am not so much interested in
the average as I am interested in finding out the size of the total universe
of
finite random numbers that could be compressed by this method (even if this
is only a tiny subset of all random numbers).


.



Relevant Pages

  • Re: =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
    ... >>>of the string. ... >> universal computing device, say an universal Turing machine, which IS ... K.C. is defined to require an universal computer, ... >These are different forms of potential compression. ...
    (talk.origins)
  • =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
    ... >>of the string. ... These are different forms of potential compression. ... >>functional system may not be able to sustain such sequence compression ... Chaos theory is about DETERMINISTIC systems which amplify small ...
    (talk.origins)
  • Re: Attention Sean - question about CSI
    ... Maybe the degree of compression can serve as a measure ... If I am allowed to choose the compression algorithm *after* ... which compresses that string to a single bit. ... If you are allowed to transmit the data separately, ...
    (talk.origins)
  • Re: Attention Sean - question about CSI
    ... Maybe the degree of compression can serve as a measure ... If I am allowed to choose the compression algorithm *after* ... which compresses that string to a single bit. ... Yet, for a truly random sequence of numbers, you won't find any ...
    (talk.origins)
  • Re: Factoring
    ... From your words you claimed factoring was ... attractive because is gave a longer string of bits. ... selection of digits is obviously dependent on the based used to ... No magic compression functions from Pi my friends. ...
    (comp.compression)