Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Paper
Reliable Computation by Formulas in the Presence of Noise
Abstract
It is shown that if formulas are used to compute Boolean functions in the presence of randomly occurring failures (as has been suggested by von Neumann and others), then 1) there is a limit strictly less than 1/2 to the failure probability per gate that can be tolerated, and 2) formulas that tolerate failures must be deeper (and, therefore, compute more slowly) than those that do not. © 1988 IEEE
Related
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Reena Elangovan, Shubham Jain, et al.
ACM TODAES