A universal Brownian cellular automaton with 3 states and 2 rules |
| |
| Authors: | Teijiro Isokawa Ferdinand Peper Koji Ono Nobuyuki Matsui |
| |
| Affiliation: | 1.Graduate School of Enginnering,University of Hyogo,Himeji, Hyogo,Japan;2.Center for Information and Neural Networks,National Institute of Information and Communications Technology, and Osaka University,Suita, Osaka,Japan |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
