On connectionist models
โ Scribed by Jiawei Hong
- Publisher
- John Wiley and Sons
- Year
- 1988
- Tongue
- English
- Weight
- 560 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
โฆ Synopsis
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, connectionist models do not possess any basic properties different from those of other (nonuniform) highly parallel hardware models.
๐ SIMILAR VOLUMES
Neural network models are used to investigate the ways in which bees use landmarks to navigate through space. The snapshot hypothesis, whereby bees remember a position in space by taking an instantaneous snapshot of the configuration of landmarks, is explored using a Hebbian learning rule and a dist