On the maximum tolerable noise for reliable computation by formulas
- 1 May 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (3) , 1299-1305
- https://doi.org/10.1109/18.669417
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.08856Keywords
This publication has 5 references indexed in Scilit:
- Signal propagation, with application to a lower bound on the depth of noisy formulasPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Information theory and noisy computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the maximum tolerable noise for reliable computation by formulasIEEE Transactions on Information Theory, 1991
- Reliable computation by formulas in the presence of noiseIEEE Transactions on Information Theory, 1988
- Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable ComponentsPublished by Walter de Gruyter GmbH ,1956