On the implementation of set-valued non-Boolean switching functions

Biological computing based on the interactions between engines and substrate is addressed. An upper bound is given on the complexity of the bio-circuits that realize set-valued functions. This bound is based on an equivalence attached to a set-valued function such that the classes of the quotient set of the definition domain with respect to such an equivalence coincide with the maximal sets on which the function can be evaluated by computing a value of a Boolean function.<
>