• Corpus ID: 14580888

Undecidability of CA Classification Schemes

@article{Culk1988UndecidabilityOC,
  title={Undecidability of CA Classification Schemes},
  author={Karel Cul{\'i}k and Sheng Yu},
  journal={Complex Syst.},
  year={1988},
  volume={2}
}
Abstra ct. Stephen wolfram int roduced the use of cellula r au tom ata. as mod els of complex sys tems and proposed a clas sification of th ese automata based on th eir st a t ist ical ly observed behavior. We invest igate various properti es of these classes; in part icular, we as k wheth er certain prop erties are effective, and we obtain several somewhat surpri sing result s. For examp le, we show th at it is undecidable wheth er all th e fini te configu rations of a given cellular automaton… 
View Paper
complex-systems.com
157 Citations
Highly Influential Citations
6
Background Citations
47
Methods Citations
7
Results Citations
1

Figures from this paper

157 Citations

Cellular Automata with Regular Behavior

It is proven that CA with code 0110 behave regularly on seeds belonging to the set I = EO-r where E = {a, I} and r = EOUEOlll E O, where e, is some constant depending on r.

Complex Chaotic Behavior of a Class of Subshift Cellular Automata

A new class of cellular auto mata is identified that is characterized by shift like dynamics (simple and complex subshift rules); these cellular automata correspond to t he asymmet ric sit uations and they are chaotic dynamical syst ems.

Wolfram's class IV automata and good life

Universal Cellular Automata and Class 4

It is shown that the identification of the Wolfram class depends crucially on the set of initial conditions used to simulate the given CA, indicating that a description of complex systems and information dynamics may need a new framework for non-equilibrium statistical mechanics.

Classsification of Cellular Automata

The Wolfram Classes Wolfram proposed a heuristic classification of cellular automata based on observations of typical behaviors, which comprises four classes: evolution leads to trivial configurations, to periodic configurations, evolution is chaotic, evolution lead to complicated, persistent structures.

Irreducibility and Computational Equivalence

It is shown that systems in Class III are indeed capable of computation and that there is no reason to believe that they are unable, in principle to reach Turing universality.

Monomial Cellular Automata

This work investigates the dynamical features of monomial cellular automata, whose next-st ate is given as a product of t he neighb orin g states, and analyzes monomials of higher degree via a superpos it ion prin ciple.

On the Classifiability of Cellular Automata

Self-referential basis of undecidable dynamics: from The Liar Paradox and The Halting Problem to The Edge of Chaos

The Immortality Problem for LAG Systems

...

References

SHOWING 1-10 OF 15 REFERENCES

Computation theory of cellular automata

The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages and it is suggested that such undecidability is common in these and other dynamical systems.

Refere nces

  • Refere nces

U niversality and Com plexity in Cellula r Automat a

  • U niversality and Com plexity in Cellula r Automat a
  • 1984

Introduction to Automata T heory

  • Lenguages, and Computa tion,
  • 1979

Computatio n Th eory of Cellular Auto mata:"I Communications in Ma tllemat ical P hysics

  • Computatio n Th eory of Cellular Auto mata:"I Communications in Ma tllemat ical P hysics
  • 1984

Tessellation wit h Local T ran sformatio ns" ) Journal of Com pute r an d Sy stem Sciences

  • Tessellation wit h Local T ran sformatio ns" ) Journal of Com pute r an d Sy stem Sciences
  • 1972

Ullman, I ntroduction to A utomata T heory, Lenguages , and Comp uta tion

  • Ullman, I ntroduction to A utomata T heory, Lenguages , and Comp uta tion
  • 1979

Karel Cu lik II and Sheng Yu

  • Karel Cu lik II and Sheng Yu

dson, "Tessellation with Local Tran sformations

  • Journal of Com pute r an d System Sciences,
  • 1972

Machine Models od Self-Reproductio n

  • P roc. of Symp osium in AppUed Math em atics
  • 1961