Cellular automata with non-working cells

Abstract

The existence of these automata is demonstrated by giving the rules for a particular automaton that has the desired properties. This model generally uses double paths for the transfer of information. Signals are propagated along such paths at the rate of one cell per two time steps. The underlying space has the usual 5-cell neighborhood. The model is presented by showing how the various basic operations for transfer of information, logical control, and construction of new automata are performed. Verification of the proper working of the model is done by extensive computer simulation.