Abstract
It is shown that, given a Hopfield net, it is NP-hard to count either the number of stable states or the number of states converging to a given stable state. The latter result holds even when the interconnection weights between neurons are restricted to 0 or +or-1. The authors show that the stable state counting problem and the problem of counting states converging to a given stable state in a single parallel update step are both Hash P-complete. A remaining open problem is to show that computing the size of the full attraction domain of a given stable state is also Hash P-complete. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
