Computing with Noise - Phase Transitions in Boolean Formulas
Disordered Systems and Neural Networks
2015-05-14 v1 Computational Complexity
Abstract
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. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding typical-case phase transitions. This framework paves the way for obtaining new results on error-rates, function-depth and sensitivity, and their dependence on the gate-type and noise model used.
Cite
@article{arxiv.0908.3981,
title = {Computing with Noise - Phase Transitions in Boolean Formulas},
author = {Alexander Mozeika and David Saad and Jack Raymond},
journal= {arXiv preprint arXiv:0908.3981},
year = {2015}
}
Comments
10 pages, 2 figures