Sequences of memories in Boolean networks

Timothy L.H. Watkin and David Sherrington

Physica A: Statistical Mechanics and its Applications, 1992, vol. 185, issue 1, 449-452

Abstract: 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.

Date: 1992
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/037843719290488C
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:185:y:1992:i:1:p:449-452

DOI: 10.1016/0378-4371(92)90488-C

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().