Abstract
“Neuronic” or “decision equations”, first proposed as a mathematical model of neural activity, have shown, after their exact, compact solution was found, typical behaviours that make them natural tools for General Systems studies. It is shown here that their mathematical investigation is remarkably furthered by generalizing the “triangular inequality” to “polygonal” ones. These permit the immediate computation of the tensorial expansion of linearly separable boolean functions, and exhibit clearly the connection between their “continuous” and “discontinuous” aspects.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Caianiello, E.R.: Outline of a theory of thought-processes and thinking machines. J. Theor. Biol. 1, 209–235 (1961)
Caianiello, E.R.: Some remarks on the tensorial linearization of general and linearly separable Boolean functions. Kybernetik 12, 90–93 (1973)
Caianiello, E.R., Grimson, W.E.: Syntesis of Boolean nets and time behaviour of a general mathematical neuron. Biol. Cybern. 18, 111–117 (1975)
Dertouzos, M.L.: Thresold Logic: a synthesis approach. Res. Monograph n.32.Cambridge: M.I.T. Press (1965). Valuable also for connecting our formalism with the classic results of S.W. Golomb, the so called Rademacher-Walsh expansion, etc.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Caianiello, E.R., Simoncelli, G. Polygonal inequalities as a key to neuronic equations. Biol. Cybern. 41, 203–209 (1981). https://doi.org/10.1007/BF00340321
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00340321