[551] in Cypherpunks
re:pi compression
daemon@ATHENA.MIT.EDU (Do you know what's in the trunk? )
Tue May 25 09:26:51 1993
Date: Tue, 25 May 93 06:18:14 PDT
From: Do you know what's in the trunk? 25-May-1993 0917 <yerazunis@aidev.enet.dec.com>
To: cypherpunks@toad.com
Cc: yerazunis@aidev.enet.dec.com
Apparently-To: cypherpunks@toad.com
>
>>Since all possible finite bit strings are, by definition, contained
>>in the unending cavalcade of bits in pi,
>
>Definition? I have seen not this asserted even by theorem. Not
>surprising, since the statement is patently false. There are
>2^{\aleph_0} finite bit strings, and only \aleph_0 of those are
>subsequences of pi.
Um, it doesn't follow to me that it's _obvious_ that 2^Aleph_0 is
larger than Aleph_0.
It might be- but I'd like to see the proof.
Now, Aleph_0 ^ Aleph_0, on the other hand...
-Bill (wondering why this thread of recursively nonenumerable
transfinite ordinal stuff keeps cropping up in *all* his
mailing lists)
