On 1 Jun 2001, at 13:08, Corey Murtagh wrote:
> "Roser, Wayne" <[EMAIL PROTECTED]> wrote on 01/06/2001 12:25:15: >
> >It must, therefore, be true that the binary version contains at least
> 2 >complete copies of itself. Wow. >Wayne Roser
>
> I'm guessing that the key here is 'finite'. However there are some
> infinite sequences that have absolutely no use, and contain no
> information so they're safe to calculate. For example a series of
> '1's seperated by an ever-increasing number of '0's:
>
> 1010010001000010000010000001...
>
> Here's another one - anyone want to guess what it is? No prizes, but
> a warm fuzzy feeling of accomplishment :>
>
> 1101110010111011110001001101010111100110111101111...
>
> If you don't want to spoil it for anyone, give your answer as the next
> 20 or so bits of the sequence.
...110000010000110001010...
However, that one _does_ contain every finite binary string, so no
safer than PI to calculate it.
Seth.
=======================================================
Seth Wagoner, WebFoundry Ltd. Christchurch, New Zealand
mailto:[EMAIL PROTECTED] http://webfoundry.co.nz
---------------------------------------------------------------------------
New Zealand Delphi Users group - Delphi List - [EMAIL PROTECTED]
Website: http://www.delphi.org.nz
To UnSub, send email to: [EMAIL PROTECTED]
with body of "unsubscribe delphi"
