ABSTRACT
Associative memory is the “fruit fly” or “Bohr atom” problem of this field. It illustrates in about the simplest possible manner the way that collective computation can work. The basic problem is this:
Store a set of p patterns ξ i μ https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780429499661/9e41da1c-7aac-4e96-b07d-7228dcc08183/content/eq4.tif"/> in such a way that when presented with a new pattern ζi the network responds by producing whichever one of the stored patterns most closely resembles ζi .
