On the maximum tolerable noise for reliable computation by formulas

IEEE Transactions on Information Theory

Volumn 44, Issue 3, 1998, Pages 1299-1305

  Evans, William ^b   Pippenger, Nicholas ^a,c  

^a IEEE

^b University of Arizona   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Logical formulas; NAND gates; Reliability

Indexed keywords

BOOLEAN ALGEBRA; BOOLEAN FUNCTIONS; COMPUTATION THEORY; POLYNOMIALS; PROBABILITY; SET THEORY;

LOGICAL FORMULAS; MAXIMUM TOLERABLE NOISE;

LOGIC GATES;

EID: 0032070548     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.669417     Document Type: Article

References (7)

1. W. S. Evans, "Information theory and noisy computation," Ph.D. dissertation, Com. Sci., Univ. California, Berkeley, 1994.
2. W. Evans and L. J. Schulman, "Signal propagation, with application to a lower bound on the depth of noisy formulas," in Proc. IEEE Symp. on Foundations of Computer Science, 1993, vol. 34, pp. 594-599.
3. _, "Information theory and noisy computation," in Proc. 1995 IEEE Int. Symp. Information Theory (Whistler, BC, Canada, Sept. 1995), p. 456.
4. B. Hajek and T. Weller, "On the maximum tolerable noise for reliable computation by formulas,"IEEE Trans. Inform. Theory, vol. 37, pp. 388-391, 1991.
5. J. von Neumann, "Probabilistic logics and the synthesis of reliable organisms from unreliable components," in Automata Studies, C. E. Shannon and J. McCarthy, Eds. Princeton, NJ: Princeton Univ. Press, 1956, pp. 43-98.
6. N. Pippenger, "Reliable computation by formulas in the presence of noise," IEEE Trans. Inform. Theory, vol. 34, pp. 194-197, 1988.
7. E. L. Post, The Two-Valued Iterative Systems of Mathematical Logic. Princeton, NJ: Princeton Univ. Press, 1941.