Replies

The bottom line to me is that Champernowne’s binary constant produces in such a distinctive pattern, it cannot overcome, by 8 bit alphanumeric ASCII concatenation, unreadable characters.

I think you are looking at it the wrong way.

1) You have a finite string of ASCII bytes of length n
2) View it as just a finite string of bytes of length n -- the fact that it is ASCII encoded is not relevant because the information is preserved.
3) Consider the set of all binary encoded integers of bit-length n*8, where n is the length of the text from (1)
4) The finite set of integers in (3) will, not surprisingly, contain an integer with the exact same bit pattern as the ASCII string in (1).
5) Since Champernownes number is a concatenation of all integers (binary or otherwise -- it doesn't really matter), it will also contain every integer in the set described in (3).
6) Therefore, Champernowne's number will contain every finite string of ASCII bytes, including Shakespeare, and including (1).

Do you see it now? :-)

Thank you for your post!

Here is Doctor Stochastic’s formulation:

Simple Rule: concatenate the integers base two: 110111001001.... Treat blocks of eight as Ascii encoding. Everything ever written will be in the sequence: the works of Shakespeare, a description of design of a Sherman tank, this thread, a description of every living thing.

That produces this pattern:

1
10 11
100 101 110 111
1000 1001 1010 1011 1100 1101 1110 1111
10000 10001 10010 10011 10100 10101 10110 10111 11000 11001 11010 11011 11100 11101 11110 11111
100000 100001 100010 100011 100100 100101 100110 100111 101000 101001 101010 101011 101100 101101 101110 101111 110000 110001 110010 110011 110100 110101 110110 110111 111000 111001 111010 111011 111100 111101 111110 111111
1000000 1000001 1000010 1000011 1000100 1000101 1000110 1000111 1001000 1001001 1001010 1001011 1001100 1001101 1001110 1001111 1010000 1010001 1010010 1010011 1010100 1010101 1010110 1010111 1011000 1011001 1011010 1011011 1011100 1011101 1011110 1011111 1100000 1100001 1100010 1100011 1100100 1100101 1100110 1100111 1101000 1101001 1101010 1101011 1101100 1101101 1101111 1110000 1111000 1111001 1111010 1111011 1111100 1111101 1111110 1111111

etc.

If I treat blocks of 8 of the above binary as an ASCII byte, I will get numerous unprintable/unreadible characters throughout because of the pattern, the hanging high order 1's filling left to right. Thus, no Shakespeare, no Omega, etc.

You are starting in reverse, by taking a finite string of ASCII bytes at length of n and then figuring all binary encoded integers of bit-length n*8.

Eventually you will get the original string. Sure. Start with the length of Shakespeare work and then figure all the possible binary combinations in that length.

But that is not the pattern stipulated by Doctor Stochastic's formulation. Nor is your formulation compatible with the definition of Champernowne’s constant from Wolfram’s website and others I found, all of which are more like Doctor Stochastic’s where the increment for binary proceeds upward in a highly structured pattern.