On a problem in the collective behavior of automata

✍ Scribed by Paul M.B. Vitányi

• Publisher: Elsevier Science
• Year: 1976
• Tongue: English
• Weight: 344 KB
• Volume: 14
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(76)90011-x

✦ Synopsis

THE COLLECTIVE BEHAVIOR Varslltlvsky 14) irlucst;lg&d the function L : N -+ N informally defined by: L(H) is tllc m;1ximum length of a configku-ation whiol~ can be grow;.. frotn one ;Uivated automaton in a linear cel1 space of ider2tical finite s?We automata kkng IZ ir2tenr~l st;ltes, Each auton2aton in the linear cell sp~e receives input frcrm botl~ tleighbors. In [4] it is shown that 1;(3 j = 7, L(4) Z 45, ar2d a +x3-y fzstly incrkxsir2g computable fun&xi is Jerived which is a lIower bound 012 L. Here we observe