HIGH SPEED SIMULATIONS OF ORDERED AND DISORDERED CELLULAR AUTOMATA

Abstract
“Dissident” sites in random Boolean automata always differ from all their four nearest neighbors. We check how their number decreases if for each such site the rule which it obeys is inverted in regular intervals. We updated 0.9 sites per nanosecond on one NEC-SX3 processor; for simple one-dimensional exclusive-or automata, we updated 14 sites per nanosecond.

This publication has 0 references indexed in Scilit: