Abstract
We consider the realization of Boolean functions by nonbranching programs with conditional stop operators in an arbitrary complete finite basis. We assume that conditional stop operators are absolutely reliable, while all functional operators are prone to output inverse failures independently of each other with probability e in the interval (0, 1/2). We prove that any Boolean function is realizable by a program with unreliability e +8 1e 2 for all e ∈ (0, 1/960).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
