We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Towards intrinsically universal asynchronous CA.
- Authors
Worsch, Thomas
- Abstract
We consider asynchronous one-dimensional cellular automata (CA). It is shown that there is one with von Neumann neighborhood of radius 1 which can simulate each asynchronous one-dimensional cellular automaton. Analogous constructions are described for α-asynchronous CA (where each cell independently enters a new state with probability α, and for “neighborhood independent” asynchronous CA (where never two cells are updated simultaneously if one is in the neighborhood of the other). This also gives rise to a construction for so-called fully asynchronous CA (where in each step exactly one cell is updated).
- Subjects
CELLULAR automata; PATTERN recognition systems; SEQUENTIAL machine theory; PARALLEL processing; SWARM intelligence
- Publication
Natural Computing, 2013, Vol 12, Issue 4, p539
- ISSN
1567-7818
- Publication type
Article
- DOI
10.1007/s11047-013-9388-3