Re: Anyone wanna help with a compression routine (new type)

[A complimentary Cc of this posting was sent to
WM
<mueckenh@xxxxxxxxxxxxxxxxx>], who wrote in article <04e91d5a-3cd0-4e19-abdf-c8f79fd45a0a@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>:
far as I understood, we know: For every language a part of at least 1
- 2^-d of all bit sequences of length n has a Kolmogorow-complexity of
at least n - d. This yields the result (for d =3D 1) that at least half
of the strings have a Kolmogorow-complexity of at least n - 1, and
(for d =3D 0) that at least the empty set of strings has the complexity
of at least n - 0 =3D n.

This does not make sense. The Kolmogorow-complexity is defined up to
an additive constant ("the information contained in the
compiler/decompressor").

Hope this helps,
Ilya

.

Relevant Pages
Loading