Computation Based on Signal Random Fluctuation in Asynchronous Cellular Automata

Abstract

A Brownian cellular automaton (BCA) is an asynchronous cellular automaton (ACA) in which the local configurations representing signals may fluctuate randomly in the cell space. The random fluctuation of signals enables effective stochastic search to conduct computation, which can actually result in the decreased complexity of BCAs. This paper proposes a novel BCA based on a conventional ACA, which employs a smaller number of rules as compared to the previous model. This BCA is capable of universal computing which might demonstrate the crucial role of signal random fluctuation for reducing the complexity of universal ACAs.