![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
Abstract
We study the recognition properties of a modification of the Willshaw associative memory with a floating threshold analytically for the asymptotic case of large networks and single-step retrieval. The number of spurious stable states and the size of their attraction basins are calculated. Comparison is made with simulations for single- and multistep dynamics. The appropriateness of the recognition procedure based on the remanent overlap is demonstrated.