Sequences of memories in Boolean networks
We show that an extremely dilute network of Boolean logic devices may be taught to recall a sequence of memories with very high accuracy. If the number of inputs to each node is c, with c large, then the network may store ≈(4/3)c/c2 patterns, many more than normal synaptic networks. We can also control all the temporal characteristics of retrieval. Finally, we consider possible extensions to the model.
Year of publication: |
1992
|
---|---|
Authors: | Watkin, Timothy L.H. ; Sherrington, David |
Published in: |
Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 185.1992, 1, p. 449-452
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Selecting examples for an optimal perceptron
Watkin, Timothy L.H., (1992)
-
The minority game: effects of strategy correlations and timing of adaptation
Sherrington, David, (2003)
-
Stationary states of a spherical Minority Game with ergodicity breaking
Galla, Tobias, (2005)
- More ...