A new version of Toom's proof
Formal Languages and Automata Theory
2021-05-14 v1 Probability
Abstract
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.
Cite
@article{arxiv.2105.05968,
title = {A new version of Toom's proof},
author = {Peter Gacs},
journal= {arXiv preprint arXiv:2105.05968},
year = {2021}
}