scientific article
From MaRDI portal
Publication:3358252
zbMath0732.68082MaRDI QIDQ3358252
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cellular automata (computational aspects) (68Q80) Hierarchies of computability and definability (03D55)
Related Items
The complexity of reversible cellular automata ⋮ Computational processes, observers and Turing incompleteness ⋮ Cellular automata and intermediate degrees. ⋮ On the classifiability of cellular automata ⋮ A Study of Chaos in Cellular Automata ⋮ The reachability problem for finite cellular automata ⋮ Computation theoretic aspects of cellular automata ⋮ Classifying circular cellular automata