Noise threshold for universality of 2-input gates

Details Noise threshold for universality of 2-input gates Noise threshold for universality of 2-input gates

2007-11-02

arxiv.org/abs/0711.0351v2

Computer Science

Information Theory

International Symposium on Information Theory, 2007, minor corrections in v2

Scientific paper

Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail independently with probability epsilon and epsilon

Affiliated with

Also associated with

No associations

Rating

Noise threshold for universality of 2-input gates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Noise threshold for universality of 2-input gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noise threshold for universality of 2-input gates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437970