Premium
On connectionist models
Author(s) -
Hong Jiawei
Publication year - 1988
Publication title -
communications on pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.12
H-Index - 115
eISSN - 1097-0312
pISSN - 0010-3640
DOI - 10.1002/cpa.3160410804
Subject(s) - connectionism , mathematics , matrix (chemical analysis) , algorithm , computer science , arithmetic , artificial neural network , theoretical computer science , artificial intelligence , materials science , composite material
We show that an arbitrary “connectionist” model of n neutrons, defined by an n X n real matrix, can be simulated by a system of O(n 3 log n ) Boolean gates with an O (log n ) time slow‐down factor. This establishes that, even though n 2 real numbers possibly of high precision are required to define it, connectionist models do not possess any basic properties different from those of other (nonuniform) highly parallel hardware models.