On the classifiability of cellular automata
From MaRDI portal
Publication:1978505
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4211534 (Why is no real title available?)
- scientific article; zbMATH DE number 4070371 (Why is no real title available?)
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- Computation theory of cellular automata
- Machine Configuration and Word Problems of Given Degree of Unsolvability
- Measure theoretic approach to the classification of cellular automata
- Pattern growth in elementary cellular automata
Cited in
(18)- Addendum to ``A mathematical classification of the one-dimensional deterministic cellular automata
- Progress, gaps and obstacles in the classification of cellular automata
- Bulking II: Classifications of cellular automata
- scientific article; zbMATH DE number 6149843 (Why is no real title available?)
- Sub-classes and evolution stability of Wolfram's classes in the total-rule cellular automata
- A hierarchical classification of cellular automata
- Classification of backward filtrations and factor filtrations: examples from cellular automata
- Cellular automata and intermediate degrees.
- Growing patterns in 1D cellular automata
- scientific article; zbMATH DE number 798682 (Why is no real title available?)
- Exemples de classes d'automates cellulaires
- A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
- scientific article; zbMATH DE number 1462667 (Why is no real title available?)
- Characteristic parameters and classification of one-dimensional cellular automata
- An information-based classification of elementary cellular automata
- Computational classification of cellular automata
- scientific article; zbMATH DE number 1979692 (Why is no real title available?)
- Measure theoretic approach to the classification of cellular automata
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)
