DocumentCode :
1367675
Title :
On the maximum tolerable noise for reliable computation by formulas
Author :
Evans, William ; Pippenger, Nicholas
Author_Institution :
Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA
Volume :
44
Issue :
3
fYear :
1998
fDate :
5/1/1998 12:00:00 AM
Firstpage :
1299
Lastpage :
1305
Abstract :
It is shown that if a formula is constructed from noisy 2-input NAND gates, with each gate failing independently with probability E, then reliable computation can or cannot take place according as ε is less than or greater than ε0=(3-√7)/4=0.08856…
Keywords :
Boolean functions; logic gates; noise; probabilistic logic; reliability theory; failure; formulas; maximum tolerable noise; noisy 2-input NAND gates; probability; reliable computation; Boolean algebra; Boolean functions; Computer science; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.669417
Filename :
669417
Link To Document :
بازگشت