On the maximum tolerable noise for reliable computation by formulas

DOI10.1109/18.75261zbMath0721.94025OpenAlexW2064369971MaRDI QIDQ5753892

Bruce Hajek, Timothy Weller

Publication date: 1991

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8884d3a72a4b3736cb4303c872d99701df875d55

zbMATH Keywords

Boolean functionscomputation by unreliable componentsreliability computing

Mathematics Subject Classification ID

Related Items

Broadcasting on trees and the Ising model., Robust reconstruction on trees is determined by the second eigenvalue., Information flow on trees, Attainable set of a nonlinear controlled microeconomic model, Locating Errors in Faulty Formulas, Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets