On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 43. DOI: 10.17223/20710410/43/5

The implementation of Boolean functions by non-branching programs with a conditional stop operator is considered in a complete finite basis containing a generalized conjunction, i.e. a function ofthe form x₁^a1&x₂^a2 (α1,α2 ∈ {0, 1}). The computational operators are assumed to go into faulty states of an arbitrary type independently of each other with a probability not exceeding the value N (B), i.e. unreliability of the most unreliable (“bad”) of the basic elements. In addition, conditional stop operators are also unreliable and independently of each other are prone to two types of faults: the first and second kind. The fault of the first kind is characterized by the fact