Description:
<jats:title>Abstract</jats:title><jats:p>We show that an arbitrary “connectionist” model of <jats:italic>n</jats:italic> neutrons, defined by an <jats:italic>n</jats:italic> X <jats:italic>n</jats:italic> real matrix, can be simulated by a system of <jats:italic>O(n</jats:italic><jats:sup>3</jats:sup>log <jats:italic>n</jats:italic>) Boolean gates with an <jats:italic>O</jats:italic>(log <jats:italic>n</jats:italic>) time slow‐down factor. This establishes that, even though <jats:italic>n</jats:italic><jats:sup>2</jats:sup> 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.</jats:p>