Abstract:
We consider the implementation of Boolean functions by circuits of unreliable functional elements in some complete finite bases. It is assumed that each of the circuit elements is exposed to disjunctive (conjunctive) coalescence of inputs independently of the other elements. It is shown that in some bases any Boolean function can be implemented by a circuit with any high reliability, and in some ones it can be done by a circuit with the unreliability, which is equal to zero.
Keywords:unreliable functional elements, circuit reliability, circuit unreliability, coalescences of elements inputs.