Computing with noise: phase transitions in Boolean formulas
Mozeika, Alexander; Saad, David and Raymond, Jack (2009). Computing with noise: phase transitions in Boolean formulas. Physical review letters, 103 (24), p. 248701.
Official URL: http://link.aps.org/doi/10.1103/PhysRevLett.103.24...
Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Existing bounds on their performance are straightforwardly retrieved, generalized, and identified as the corresponding typical-case phase transitions. Results on error rates, function depth, and sensitivity, and their dependence on the gate-type and noise model used are also obtained.
|Additional Information:||© 2009 The American Physical Society|
|Uncontrolled Keywords:||Computing circuits, noisy logical gates, Boolean functions, given level of error, statistical mechanics, Physics and Astronomy(all)|
|Divisions:||Schools_of_Study > Engineering & Applied Science > Mathematics (EAS)|
Schools_of_Study > Engineering & Applied Science
|Deposited By:||David Saad|
|Deposited On:||19 Jul 2010 15:31|
|Last Modified:||30 Oct 2014 08:07|
Repository Staff Only: item control page