Re: Universal grammar

Hans,

A long message. In the hopes of finding some consensus I've reduced it
down to the bit we agree on. That makes the discussion much shorter :-)

Hans Aberg wrote:
In article <1161318846.624985.11180@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>, "Rob
Freeman" <groups@xxxxxxxxxxxxxxxxxxx> wrote:

Is it possible to reduce all of mathematics to logic?
....
Is it possible to reduce all patterns to logic?
...
I don't know about you, but I'm starting to think "incompressible
string".

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

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

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

All one can say is that the logical foundations of mathematics have
not yet been cleared up.

I'll take that.

...pinning down a human language in terms of grammar and semantical
rules ... should not be a problem of logical foundations.

Why? We have established that there is a problem with the logical
foundations of mathematics. Why do you think there should not be a
problem with the logical foundations of language?

A problem is after all is what we see, what we have seen for 50 years,
what Chomsky saw. That was why he thought he had to propose a Universal
Grammar.

-Rob

.

Relevant Pages

  • 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: 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)
  • Re: What is the state-of-the-art analysing hardware impact on achievable compression rat
    ... >> about the strings for which programs exist and the strings for which it ... >> depend on the instruction set supported by the CPU? ... compression possible: some of the content of the string to compress is ... There is no algorithm to compute Kfor all x in any L. ...
    (comp.compression)
  • Re: Data mining algorithm
    ... the "best" descriptive strings for data. ... That sounds like the first step of a compression algorithm. ... In a similar data set this column will show similar repetativeness at ...
    (comp.programming)