On the classifiability of cellular automata

Abstract: Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into 4 types. He distinguishes the 4 classes of cellular automata by the evolution of the pattern generated by applying a cellular automaton to a finite input. Wolfram's qualitative classification is based on the examination of a large number of simulations. In addition to this classification based on the rate of growth, he conjectured a similar classification according to the eventual pattern. We consider here one formalization of his rate of growth suggestion. After completing our major results (based only on Wolfram's work), we investigated other contributions to the area and we report the relation of some of them to our discoveries.

Review text

Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into four types. We show a natural formalization of his rate of growth suggestion does not provide a classification (even probabilistically) of all cellular automata: For any rational \(p,q,0\), \(p,q\leq 1\) with \(p+q=1\), there is a cellular automata \(A_{p,q}\) which has probability p of being in class 3, probability q of being in class 4. We also construct an automata which grows monotonically at rate log \(t\), rather than at a constant rate.

Recommendations

Cites work

Cited in

(21)

This page was built for publication: On the classifiability of cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978505)