Synchronous and asynchronous updating in cellular automata
Asynchronous systems tend to use synchronization only on a local scale—if they use it at all.
Research on cellular automata that are truly asynchronous has been limited mostly to trivial phenomena, leaving issues such as computation unexplored.
This paper presents an asynchronously updating cellular automaton that conducts computation without relying on a simulated global synchronization mechanism.
For each rule, the five models were initialised to random states.
Despite the probabilistic nature of asynchronous updating, the outcome of the dynamics is deterministic.