Complex Specified Information - Pitman Formula

After a bit of discussion and revision of my initial effort, the
following is my formula for calculating my version of complex
specified information (CSI):

For X = 2:

CSI: X^n - (n! / (n-hd)! hd!)

For X > 2:

CSI: X^n - (( log(base2)(X^n)! / (log(base 2)(X^n) - hd)! * hd!)

X = number of possible characters per position
n = size of the sequence
hd = Hamming Distance

And yes, I have tried it out and it does seem to work quite well
regardless of string size or the number of potential characters per
position. Hopefully no further revisions will be necessary, but
that's why I'm presenting it here to see if anyone can find anything
wrong with the formula.

As it currently stands, the greater the CSI number, the better the
odds of non-random production. This is especially true when compared
to reference sequences with no repeating patterns, like pi, regardless
of the assumed distribution of the origin of the symbols in the test
sequence.

I also want to note, one more time, that the detecting of high CSI, by
itself, does not equal the detection of ET or ID. That sort of
hypothesis requires additional knowledge concerning the material in
which the pattern in carried as well as how this material interacts
with various deliberate and non-deliberate forces of nature.

Sean Pitman
www.DetectingDesign.com

.

Relevant Pages

  • Re: Complex Specified Information - Pitman Formula
    ... n = size of the sequence ... to reference sequences with no repeating patterns, like pi, regardless ... I also want to note, one more time, that the detecting of high CSI, by ... which the pattern in carried as well as how this material interacts ...
    (talk.origins)
  • Re: Complex Specified Information - Pitman Formula
    ... n = size of the sequence ... I also want to note, one more time, that the detecting of high CSI, by ... which the pattern in carried as well as how this material interacts ...
    (talk.origins)
  • Re: Complex Specified Information - Pitman Formula
    ... sequence difference between all the sites being the same and all the ... to reference sequences with no repeating patterns, like pi, regardless ... I also want to note, one more time, that the detecting of high CSI, by ... which the pattern in carried as well as how this material interacts ...
    (talk.origins)
  • Re: jacko
    ... repeating patterns. ... I don't see how you could compress data that ... in equal proportions. ... Therefore no sequence can be said to 'repeat' as it occurs no more often than any other sequence of equal ...
    (comp.compression)