Computational problems in the hear perceptron. A possible solution: Dynamic Definition of Net Topology

摘要

With respect to Rosenblatt linear perceptron, two classical limitation theorems demonstrated by M. Minsky and S. Papert are discussed. These two theorems, ''Ψ{sub}one-in-a-box" and "Ψ{sub}parity", ultimately concern the intrinsic limitations of parallel calculations in pattern recognition problems. We demonstrate a. possible solution of these limitation problems by substituting the static definition of characteristic functions and of their domains in the "geometrical" perceptron, with their dynamic definition. This dynamics consists in the mutual redefinition of the characteristic function and of its domain depending on the matching with the input.