DIOPHANTINE NEURAL NETWORKS OVER A FINITE-FIELD - METHODS OF SYNTHESIS AND MINIMIZATION OF THEIR COMPLEXITY

The paper is concerned with synthesis of the architecture, minimizatio n of the complexity, and recurrent local learning and self-organizatio n algorithms for Diophantine neural networks over a finite field that generalize logical and threshold-polynomial networks in a Boolean fiel d.