scientific article
From MaRDI portal
Publication:3212314
zbMath0724.68072MaRDI QIDQ3212314
Kristian Lindgren, Mats G. Nordahl
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
The Complexity of Small Universal Turing Machines: A Survey ⋮ Unraveling simplicity in elementary cellular automata ⋮ Cellular automata universality revisited ⋮ Dynamic modularity in discrete-time models of regulatory networks ⋮ Co-evolving non-uniform cellular automata to perform computations ⋮ Predicting nonlinear cellular automata quickly by decomposing them into linear ones ⋮ Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns ⋮ Phenomenlogy of nonlocal cellular automata ⋮ An information-based classification of elementary cellular automata ⋮ Parallel simulation of a cellular pollution model ⋮ Defect particle kinematics in one-dimensional cellular automata ⋮ Efficient unidimensional universal cellular automaton ⋮ On Goles' universal machines: a computational point of view ⋮ 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 ⋮ Explicit construction of single input-single output logic gates from three soliton solution of Manakov system ⋮ Three small universal spiking neural P systems ⋮ Upper bound on the products of particle interactions in cellular automata ⋮ Quasilinear cellular automata ⋮ Computational mechanics of cellular automata: an example ⋮ The complexity of small universal Turing machines: A survey ⋮ Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems ⋮ Average-Case Completeness in Tag Systems ⋮ Closed-form analytic maps in one and two dimensions can simulate universal Turing machines ⋮ Surprising Areas in the Quest for Small Universal Devices ⋮ Frontier between decidability and undecidability: A survey ⋮ Graph-theoretical characterization of invertible cellular automata ⋮ On fungal automata ⋮ A universal cellular automaton in quasi-linear time and its S-m-n form
This page was built for publication:
