Algorithms for fast alignment of structures in finite and periodic systems.
-
Updated
Aug 11, 2022 - Fortran
Algorithms for fast alignment of structures in finite and periodic systems.
Implementing Hopfield Networks from scratch, testing their content addressable memory, attractor, and energy landscape, investigating their resistance to noise, experimenting with their memory capacity, and putting strain on them with sparse patterns.
The Hopfield network, a point attractor network, is modified here to investigate the behavior of the resting state challenged with varying degrees of noise.
Add a description, image, and links to the energy-landscapes topic page so that developers can more easily learn about it.
To associate your repository with the energy-landscapes topic, visit your repo's landing page and select "manage topics."