On real-time cellular automata and trellis automata
Acta Informatica
A six-state minimal time solution to the firing squad synchronization problem
Theoretical Computer Science
A universal cellular automaton in quasi-linear time and its S—m—n form
Theoretical Computer Science
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
A new kind of science
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Theoretical Computer Science
Cellular automata: real-time equivalence between one-dimensional neighborhoods
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
We show how natural universal computations can be achieved on one-dimensional cellular automata. That model of computation is obviously Turing complete but how can we effectively program any given computation is far less known. In this paper we are interested in intrinsic universality; we want a CA in which any other CA can be represented and simulated with no intermediate coding relevant to another computation model. The first step is to abstract from the space-time diagram in favor of a more essential dependency graph. Then such dependency graph can be projected on grids. This work shows that grids put forward causality in place of space-time contingencies.