Re: Universal grammar

"Hans" == Hans Aberg <haberg@xxxxxxxxxx> writes:

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

Hans> Data compression relies on finding structures, and providing
Hans> a more efficient (data space wise) representation. If the
Hans> string appear as random to the algorithm that tries to
Hans> determine these structures, there will be no compression.

Actually, some people use this as the definition of "random". :)

And using that definition, the digits of pi aren't random, because
they can be described by a finite (and pretty short) algorithm.



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

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

Relevant Pages

  • Re: Universal grammar
    ... computer data compression. ... Good, good, Hans. ... The question, rephrased again, is, are all strings compressible? ...
    (sci.lang)
  • Re: Universal grammar
    ... Hans Aberg wrote: ... finding structures, ... there will be no compression. ... they can be described by a finite algorithm. ...
    (sci.lang)
  • Re: Universal grammar
    ... Hans> Data compression relies on finding structures, ... Hans> a more efficient representation. ... there will be no compression. ... they can be described by a finite algorithm. ...
    (sci.lang)
  • Re: Guitars with a physical abuse story
    ... hans wrote: ... newer strings, and as I was bringing it up to ... strings a little more and heard a creaking sound. ... maybe I can put the neck angle back where it belongs. ...
    (rec.music.makers.guitar.acoustic)
  • Re: Keeping the old fingers in shape
    ... Hans van leeuwen wrote: ... > Yesterday evening at the home of my friend Keith Freeman trying out my ... > CrafterCT-125CN/nylon strings. ...
    (rec.music.makers.guitar.jazz)