On connectionist models
Jiawei Hong · Communications on Pure and Applied Mathematics · 1988
Abstract 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(n3log n) Boolean gates with an O(log n) time slow‐down factor. This establishes that, even though n2 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.