A new version of Toom's proof
Péter Gács · arXiv (Cornell University) · 2021
There are several proofs now for the stability of Toom's example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Toom's original proof: the present report is a simplified exposition of their proof.