On the classifiability of cellular automata

John T. Baldwin*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

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 with p + q = 1, there is a cellular automata Ap,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.

Original languageEnglish
Pages (from-to)117-129
Number of pages13
JournalTheoretical Computer Science
Volume230
Issue number1-2
DOIs
StatePublished - 6 Jan 2000

Keywords

  • Cellular automata
  • Classification
  • Turing machines

Fingerprint

Dive into the research topics of 'On the classifiability of cellular automata'. Together they form a unique fingerprint.

Cite this