The paper builds on a recent explicit numerical algorithm for Kolmogorov`s superpositions, and will show that in order to synthesize minimum size (i.e., size-optimal) circuits for implementing any Boolean function, the nonlinear activation function of the gates has to be the identity function. Because classical and--or implementations, as well as threshold gate implementations require exponential size, it follows that size-optimal solutions for implementing arbitrary Boolean functions can be obtained using analog (or mixed analog/digital) circuits. Conclusions and several comments are ending the paper.
|Title of host publication||International Symposium on Nonlinear Theory and Its Applications|
|Publication status||Published - Dec 31 1998|
|Event||NOLTA'98 - Crans-Montana, Switzerland|
Duration: Sep 14 1998 → …
|Period||9/14/98 → …|