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.
- Computation by unreliable components
- reliable computing
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences