Undecidability of CA Classification Schemes

@article{Culik1988UndecidabilityOC,
  title={Undecidability of CA Classification Schemes},
  author={Karel Culik and Sheng Yu},
  journal={Complex Systems},
  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… CONTINUE READING
70 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 70 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

On t he Limit Sets of Cellul ar Automata

  • 1. Culik, J. Pachl, S. Yu
  • Research Report CS-87-47,
  • 1987

Twenty P roblems in the Theory of Cellular Auto mat a

  • S. Wolfram
  • Pivyeice Scrip ta, T
  • 1985

Computatio n Th eory of Cellular Auto mata:"I

  • S. Wolfram
  • Communications in Matllemat ical Physics,
  • 1984

olfram, "U niversality and Complexity in Cellula r Automat a

  • S. w
  • Physica, lO D
  • 1984

dson, "Tessellation with Local Tran sformations

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

Machine Models od Self-Reproduction

  • E. F . Moore
  • Proc. of Symposium in AppUed Math ematics ,
  • 1961

Similar Papers

Loading similar papers…