DocumentCode :
2182640
Title :
On networks of noisy gates
Author :
Pippenger, Nicholas
fYear :
1985
fDate :
21-23 Oct. 1985
Firstpage :
30
Lastpage :
38
Abstract :
We show that many Boolean functions (including, in a certain sense, "almost all" Boolean functions) have the property that the number of noisy gates needed to compute them differs from the number of noiseless gates by at most a constant factor. This may be contrasted with results of von Neumann, Dobrushin and Ortyukov to the effect that (1) for every Boolean function, the number of noisy gates needed is larger by at most a logarithmic factor, and (2) for some Boolean functions, it is larger by at least a logarithmic factor.
Keywords :
Boolean functions; Computational modeling; Computer networks; Error probability; Reliability theory; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1985., 26th Annual Symposium on
Conference_Location :
Portland, OR, USA
ISSN :
0272-5428
Print_ISBN :
0-8186-0644-4
Type :
conf
DOI :
10.1109/SFCS.1985.41
Filename :
4568124
Link To Document :
بازگشت