On connectionist models
โ
Jiawei Hong
๐
Article
๐
1988
๐
John Wiley and Sons
๐
English
โ 560 KB
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(n310g n ) Boolean gates with an O(1og n ) time slow-down factor. This establishes that, even though nz real numbers possibly of high precision are required to define it,