The computing capacity of three-input multiple-valued one-threshold perceptrons

In this paper an exact and general formula is derived for the number of linear partitions of a given subset V /spl sub/ R/sup 3/, depending on the configuration formed by the points of V. V can be a multi-set, that is it may contain points that coincide. Using the formula, we obtain a fast algorithm for computing the capacity of three-input k-valued one-threshold perceptrons.