ON UPPER BOUND OF NON-BRANCHING PROGRAMS UNRELIABILITY AT ONE-TYPE CONSTANT FAULTS ON THE COMPUTATIONAL OPERATORS OUTPUTS
The realization of Boolean functions by non-branching programs with a conditional stop is considered in an arbitrary complete finite basis. It is supposed that conditional stop-operators are absolutely reliable and all computational operators are prone to one type constant faults at the outputs independently of each other with probability ε Є (0,1/2). For the basis, the upper bound ε + 4ε 2 is obtained for unreliability of non-branching programs realizing any Boolean function for all ε Є (0,1/960]. 1ll. 4, bibliogr. 6.