Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!ukc!tcdcs!dce.ie!em
From: em@dce.ie (Eamonn McManus)
Newsgroups: comp.compression
Subject: Re: Hard to compress string (Was: theoretical compression factor)
Message-ID: <unitarian@dce.ie>
Date: 8 Apr 91 12:57:18 GMT
References: <1991Apr4.230820.3941@bingvaxu.cc.binghamton.edu> <5299@ns-mx.uiowa.edu>
Organization: Datacode Communications Ltd, Dublin, Ireland
Lines: 14

jones@pyrite.cs.uiowa.edu (Douglas W. Jones,201H MLH,3193350740,3193382879) writes:
>On a similar line, the sequence of decimal digits below will pass most
>tests for randomness.  I first encountered this sequence as an example
>of a patently non-random digit stream that passes essentially every test
>for randomness you can devise (short of knowing the algorithm).
...
>  01234567891011121314151617181920212223242526272829303132333435363738394...

At every position after the first, the digit 1 has occurred at least as
often as any other digit.  I would expect some tests to be able to detect
this nonrandomness.

,
Eamonn