1206.4851 (Alexander Mozeika et al.)

On reliable computation by noisy random Boolean formulas    [PDF]

Alexander Mozeika, David Saad

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.

View original: http://arxiv.org/abs/1206.4851