On a problem in the collective behavior of automata

Varshavsky defines the function L(n) as the maximum finite length of a configuration which can be grown from one activated automation in a linear cell space of identical finite state automata having n internal states. It is shown that L increases faster than any computable function, even if the flow of information in the linear cell space is restricted to one direction.