•It
was discovered that without constraints a transformational grammar was equivalent
to a Turing
Machine
•A
Turing Machine can implement any algorithm, so language is not restricted either.
•Chomsky
and company assumed that linguistics should identify constraints on what is a possible language.