On the classifiability of cellular automata

DOI10.1016/S0304-3975(99)00042-0zbMath0947.68539arXivmath/9801152OpenAlexW2052358754MaRDI QIDQ1978505

Saharon Shelah, John T. Baldwin

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9801152

zbMATH Keywords

ClassificationTuring machinesCellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

Progress, gaps and obstacles in the classification of cellular automata ⋮ Cellular automata and intermediate degrees. ⋮ Computational classification of cellular automata

Cites Work

• Pattern growth in elementary cellular automata
• Computation theory of cellular automata
• Measure theoretic approach to the classification of cellular automata
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• Unnamed Item
• Unnamed Item
• Unnamed Item

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