Reversible cellular automata in presence of noise rapidly forget everything

05/03/2021
by   Siamak Taati, et al.
0

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.

READ FULL TEXT

page 1

page 5

page 13

research
11/16/2020

Conjugacy of reversible cellular automata

We show that conjugacy of reversible cellular automata is undecidable, w...
research
10/19/2016

Finite Computational Structures and Implementations

What is computable with limited resources? How can we verify the correct...
research
12/15/2017

Ergodicity of some classes of cellular automata subject to noise

Cellular automata (CA) are dynamical systems on symbolic configurations ...
research
05/25/2018

Reversibility vs local creation/destruction

Consider a network that evolves reversibly, according to nearest neighbo...
research
05/25/2021

Evolutionary Algorithms for Designing Reversible Cellular Automata

Reversible Cellular Automata (RCA) are a particular kind of shift-invari...
research
07/13/2019

Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity

In this paper, we study reversibility of one-dimensional(1D) linear cell...
research
12/10/2020

Learnable and time-reversible cellular automata with holography principle

Recently, there are active studies to extend the concept of convolutiona...

Please sign up or login with your details

Forgot password? Click here to reset