Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states

DOI10.1088/0954-898X/3/2/006zbMath0795.68163OpenAlexW4255561275MaRDI QIDQ4034525

Friedrich T. Sommer, Günther Palm

Publication date: 16 May 1993

Full work available at URL: https://doi.org/10.1088/0954-898x/3/2/006

zbMATH Keywords

Hopfield modelMcCulloch-Pitts networksHebbian storing processlarge associative memorypattern capacity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)

Related Items (4)

Efficient and robust associative memory from a generalized Bloom filter ⋮ Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory ⋮ Iterative Retrieval and Block Coding in Autoassociative and Heteroassociative Memory ⋮ Sparse distributed memory using \(N\)-of-\(M\) codes

This page was built for publication: Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states