This is why the classical notion of competence and performance in linguistics is important. We describe programming languages as being Turing-complete even if every computer is always in practice finite because, in principle, it could be run on a computer with more memory or whatever. Likwise, it seems that language is bounded by language external facts about memory not intrinsic facts about how language is processed.