Simple Computation-Universal Cellular Spaces
From MaRDI portal
Publication:5626540
DOI10.1145/321650.321652zbMath0221.94071OpenAlexW1980118174MaRDI QIDQ5626540
Publication date: 1971
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321650.321652
Cellular automata (computational aspects) (68Q80) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Related Items
On time reduction and simulation in cellular spaces, Two-dimensional cellular automata and their neighborhoods, Some properties of topological pressure on cellular automata, Cellular automata universality revisited, The topological pressure of linear cellular automata, Universal asynchronous iterative arrays of Mealy automata, An information-based classification of elementary cellular automata, Efficient unidimensional universal cellular automaton, Decision problems for cellular automata and their semigroups, A comparison of finite and cellular automata, On Goles' universal machines: a computational point of view, On the computational power of totalistic cellular automata, Four states are enough!, Communication complexity meets cellular automata: necessary conditions for intrinsic universality, An automaton group with undecidable order and Engel problems, A survey of cellular automata: types, dynamics, non-uniformity and applications, Logical Gates via Gliders Collisions, The ontology of digital physics, Discrete event models for cell space simulation, Highly symmetric cellular automata and their symmetry-breaking patterns, Lattice games without rational strategies, Complete symmetry in d2l systems and cellular automata, A representational approach to reduction in dynamical systems, Computational complexity of dynamical systems: the case of cellular automata, The attractor-basin portrait of a cellular automaton, Bulking II: Classifications of cellular automata, On 'forgetful' cellular automata, Complexity-theoretic aspects of expanding cellular automata, Complexity-theoretic aspects of expanding cellular automata, A note on asynchronous cellular automata, On topological dynamics of Turing machines, Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration, The constructibility of a configuration in a cellular automaton, Statistical mechanics of cellular automata, Some applications of propositional logic to cellular automata, Inducing an order on cellular automata by a grouping operation, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, Graph-theoretical characterization of invertible cellular automata, On Boolean automata isolated cycles and tangential double-cycles dynamics, Analog computation with dynamical systems, A universal cellular automaton in quasi-linear time and its S-m-n form, Non-deterministic cellular automata and languages, Computation theoretic aspects of cellular automata, Computation theory of cellular automata
