Inefficiency of the block approximation in diploid probabilistic cellular automata
{{output}}
We study a probabilistic cellular automaton obtained as a mixture of the additive elementary rules 60 and 102. We prove that for any finite periodic lattice and for mixing parameter λ=1/2, the system almost surely reaches the absorbing all-zero configuration ... ...