2000 character limit reached
Reversible cellular automata in presence of noise rapidly forget everything (2105.00725v1)
Published 3 May 2021 in cs.DC, cs.ET, cs.IT, math.IT, math.PR, and nlin.CG
Abstract: We consider reversible and surjective cellular automata perturbed with noise. We show that, in the presence of positive additive noise, the cellular automaton forgets all the information regarding its initial configuration exponentially fast. In particular, the state of a finite collection of cells with diameter n becomes indistinguishable from pure noise after O(log n) time steps. This highlights the seemingly unavoidable need for irreversibility in order to perform scalable reliable computation in the presence of noise.