Computational problems in the linear perceptron: a possible solution--dynamic definition of net topology (original) (raw)

Applications and Science of Artificial Neural Networks, 1995

Abstract

ABSTRACT With respect to Rosenblatt linear perceptron, two classical limitation theorems demonstrated by M. Minsky and S. Papert are discussed. These two theorems, `(Psi) One-in-a-box' and `(Psi) 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 dynamic consists in the mutual redefinition of the characteristic function and of its domain depending on the matching with the input.

Gianfranco Basti hasn't uploaded this paper.

Let Gianfranco know you want this paper to be uploaded.

Ask for this paper to be uploaded.