Re: Attention Sean - question about CSI

"On Tue, 31 Jul 2007 19:12:04 -0600, in article
<O4Kdnbhd6Ix7QDLbnZ2dnUVZ_g6dnZ2d@xxxxxxxxxxx>, dkomo stated..."

Bobby Bryant wrote:
If I have a string of 1,000,000 random binary digits -- genuinely
random, not created by a deterministic RNG -- does it have more,
less, or the same CSI as a string of the same length where the
bits have deliberately been set, e.g. by copying a pattern?


Consider the 1,000,000 random binary digits as a file and run it through
the best compression algorithm you have. It should compress very
little. On the other hand, a file which has strong patterns will
compress a lot. Maybe the degree of compression can serve as a measure
of the "pattern-ness" of the file. What relation this would have to CSI
I'm not sure because I haven't been following the raging CSI debates.

If I am allowed to choose the compression algorithm *after*
seeing the million random digits, then I can choose one
which compresses that string to a single bit.


--
---Tom S.
"There was a lot more to magic, as Harry quickly found out, than waving your
wand and saying a few funny words."
JK Rowling, Harry Potter and the Sorcerer's Stone, Chapter VIII, page 133

.

Relevant Pages

  • Re: Attention Sean - question about CSI
    ... Consider the 1,000,000 random binary digits as a file and run it through the best compression algorithm you have. ... What relation this would have to CSI I'm not sure because I haven't been following the raging CSI debates. ... then I can choose one which compresses that string to a single bit. ... there is the whole field of statistical pattern recognition which has been specifically developed to recognize patterns in data. ...
    (talk.origins)
  • Re: Attention Sean - question about CSI
    ... Maybe the degree of compression can serve as a measure ... What relation this would have to CSI ... If I am allowed to choose the compression algorithm *after* ... which compresses that string to a single bit. ...
    (talk.origins)
  • Re: Attention Sean - question about CSI
    ... Maybe the degree of compression can serve as a measure ... What relation this would have to CSI ... which compresses that string to a single bit. ... mine points out that a single object is not random. ...
    (talk.origins)
  • Re: Attention Sean - question about CSI
    ... Maybe the degree of compression can serve as a measure ... What relation this would have to CSI ... which compresses that string to a single bit. ... if input = target then output "1" ...
    (talk.origins)
  • Re: The Pitman CSI Formula
    ... unlikely to make a design predictor. ... RNG -- to generate a string of a million binary digits and write them ... and thus not have any Dembski-style CSI because ... it would not conform to "an independently given pattern". ...
    (talk.origins)