On reliable computation by noisy random Boolean formulas
Disordered Systems and Neural Networks
2014-11-21 v2 Probability
Abstract
We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from a single majority-like gates. We show that these gates can be used to compute any Boolean function reliably below the noise bound.
Cite
@article{arxiv.1206.4851,
title = {On reliable computation by noisy random Boolean formulas},
author = {Alexander Mozeika and David Saad},
journal= {arXiv preprint arXiv:1206.4851},
year = {2014}
}
Comments
A new version with improved presentation accepted for publication in IEEE TRANSACTIONS ON INFORMATION THEORY