On reliable computation by noisy random Boolean formulas


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 gate. We show that these gates can be used to compute any Boolean function reliably below the noise bound.

Publication DOI: https://doi.org/10.1109/TIT.2014.2370638
Divisions: College of Engineering & Physical Sciences > School of Informatics and Digital Engineering > Mathematics
College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
Additional Information: © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Uncontrolled Keywords: random Boolean formulas,reliable computation,Çε-noise,Information Systems,Computer Science Applications,Library and Information Sciences
Publication ISSN: 0018-9448
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
http://ieeexplo ... rnumber=6955823 (Publisher URL)
PURE Output Type: Article
Published Date: 2015-01
Published Online Date: 2014-11-13
Authors: Mozeika, Alexander
Saad, David (ORCID Profile 0000-0001-9821-2623)



Version: Accepted Version

Export / Share Citation


Additional statistics for this record