Re: Universal grammar

"Rob" == Rob Freeman <groups@xxxxxxxxxxxxxxxxxxx> writes:

>> I do not know what you mean by this term. - I start thinking
>> about computer data compression. :-)

Rob> Good, good, Hans. We agree on something!! This is related to
Rob> the compressibility of strings.

Rob> The question, rephrased again, is, are all strings
Rob> compressible?

No. If they were, then what happens when you apply compression to the
string "it's possible" a zillion times? What's the result? And why
is it different from applying compressions a zillion times to "it's
impossible". There must be a way to discern these 2 strings. So,
after a zillion times of compression, the result must contain at least
1 bit. But shouldn't this 1-bit string be compressible, too? Then,
what happens if you try to compress this 1-bit string?




--
Lee Sau Dan 李守敦 ~{@nJX6X~}

E-mail: danlee@xxxxxxxxxxxxxxxxxxxxxxxxxx
Home page: http://www.informatik.uni-freiburg.de/~danlee
.

Relevant Pages

  • Re: Universal grammar
    ... there will be no compression. ... Rob> Good, ... Rob> proven some strings are incompressible. ... and as a model they can be a more compact ...
    (sci.lang)
  • Re: Compressing hash strings into two directions - hashing idea
    ... idea "double compression + joining for others to utilize. ... So, I should just say that the pre-hasher part,must ... >hashes (collision resistance). ... Combining the random-like strings is not be expected to make a result ...
    (sci.crypt)
  • Re: Brian Kernighan, maybe Im not worthy, maybe Im scum
    ... I've seen a fair amount of Rob Pike's code, and it looks pretty good to me. ... opinions, I respect those opinions enough to treat them seriously, because ... strings" - to C, they're just strings, and if the implementation wants ... interface appears in C Sharp as consisting of sbyte arrays. ...
    (comp.programming)
  • Re: Generic algorithms for looseless compression
    ... I think the "Kolmogorov complexity" is only relevant for such kind of ... the strings themselves. ... Algorithms based on statistics are the most ... The compression clients hold a part of that database and ...
    (comp.compression)
  • Re: Minimizing the memory requirements
    ... Wasting a lot of time saving 5000 bytes is not a good investment of time. ... redundancy and the compression really bought a lot.. ... >> I have a strange problem where in I receive a large strings of 10KB each. ... MVP Tips: http://www.flounder.com/mvp_tips.htm ...
    (microsoft.public.vc.mfc)