Fluctuation-driven computing on number-conserving cellular automata

A number-conserving cellular automaton (NCCA) is a cellular automaton in which the states of cells are denoted by integers, and the sum of all of the numbers in a configuration is conserved throughout its evolution. NCCAs have been widely used to model physical systems that are ruled by conservation laws of mass or energy. Imai et al. showed that the local transition function of NCCA can be effectively translated into the sum of a binary flow function over pairs of neighboring cells. In this paper, we explore the computability of NCCAs in which the pairwise number flows are performed at fully asynchronous timings. Despite the randomness that is associated with asynchronous transitions, useful computation still can be accomplished efficiently in the cellular automata through the active exploitation of fluctuations . Specifically, certain numbers may flow randomly fluctuating between forward and backward directions in the cellular space, as if they were subject to Brownian motion. Because random fluctuations promise a powerful resource for searching through a computational state space, the Brownian-like flow of the numbers allows for efficient embedding of logic circuits into our novel asynchronous NCCA.