|
|
|
|
|
by kjellsbells
551 days ago
|
|
Not sure about mathematically rigorous "proof", but a powerful theory of grammar at least. His claim is "true" in the sense of computation, ie the lowest level Chomsky grammar[1] is just like a Turing machine and consequently can generate anything. But the analogy with computing languages also supplies a practical insight that isnt captured by the academic theory, ie that some concepts are easier to express in one language than another. If I'm inverting a matrix, I'd reach for Python over C for example. [1] https://en.m.wikipedia.org/wiki/Chomsky_hierarchy |
|
This is why some people would even go as far as classifying Chomsky's theories as pseudo-science (see one of the replies to GP). I wouldn't go as far, but considering the almost toxic disdain Chomsky himself has to every linguist who is not interested in researching his supposed Universal Grammar (he has famously compared structural and functional linguistics to "butterfly collectors"), we should view this theory with more criticism.