Gacs, Peter
(Boston University Computer Science Department, 1998-01-05)
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information for more than a constant number of steps is nontrivial, even in an infinite ...