Abstract

According to information processing models of cognition, such as Chomsky's, the set of well-formed formulae of any natural language must be recursively enumerable (RE), otherwise, human learning language is impossible. I argue that there is nothing unlearnable about languages that are not RE. Insofar as natural languages turn out to be RE, this is to be accounted for on grounds of simplicity and not by appeal to the mistaken claim that nonRE languages are ruled out a priori. A consequence of this position is that grammars will be somewhat depsychologized, and the acquisition of competence will come to be seen as a matter of degree - perhaps admitting of refinement and improvement without end.