We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A universal Brownian cellular automaton with 3 states and 2 rules.
- Authors
Isokawa, Teijiro; Peper, Ferdinand; Ono, Koji; Matsui, Nobuyuki
- Abstract
This paper presents a 3-state asynchronous cellular automaton (CA) that requires merely two transition rules to achieve computational universality. This universality is achieved by implementing Priese’s delay-insensitive circuit elements, called the E-element and the K-element, on the cell space of a so-called Brownian CA, which is an asynchronous CA containing local configurations that conduct a random walk in the circuit topology.
- Subjects
BROWNIAN motion; CELLULAR automata; COMPUTATIONAL complexity; ELECTRIC circuits; RANDOM walks; PERTURBATION theory
- Publication
Natural Computing, 2018, Vol 17, Issue 3, p499
- ISSN
1567-7818
- Publication type
Article
- DOI
10.1007/s11047-017-9651-0