On software implementation of logical functions and automata. II. Time for computation of binary programs

General estimates for the maximal and mean computing logical functions by binary programs are given rough estimates. Method for computing the mean time required by binary programs that compute nonrepeating Boolean formulae and methods to minimize such programs in terms of mean time are proposed. The lower bound dependent on the formula depth is obtained for estimating the minimal time of computing Boolean formula.