Deterministic computations whose history is independent of the order of asynchronous updating

Peter Gacs

Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x)…