On the Maximum Tolerable Noise for Reliable Computation by Formulas

Bruce Hajek, Timothy Weller

Research output: Contribution to journalArticlepeer-review


It is shown that if formulas constructed from error-prone 3-input gates are used to compute Boolean functions, then a per-gate failure probability of 1/6 or more cannot be tolerated. The result is shown to be tight if the per-gate failure probability is constant and precisely known.

Original languageEnglish (US)
Pages (from-to)388-391
Number of pages4
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - Mar 1991


  • Computation by unreliable components
  • reliable computing

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'On the Maximum Tolerable Noise for Reliable Computation by Formulas'. Together they form a unique fingerprint.

Cite this