The DOI matches its Crossref record; 127 of the 131 references it cites were found in a registry or an index; 6 of the 40 sources its claims cite were checked for support.
AHaH Computing–From Metastable Switches to Attractors to Machine Learning
Open accessAbstract
Modern computing architecture based on the separation of memory and processing leads to a well known problem called the von Neumann bottleneck, a restrictive limit on the data bandwidth between CPU and RAM. This paper introduces a new approach to computing we call AHaH computing where memory and processing are combined. The idea is based on the attractor dynamics of volatile dissipative electronics inspired by biological systems, presenting an attractive alternative architecture that is able to adapt, self-repair, and learn from interactions with the environment. We envision that both von Neumann and AHaH computing architectures will operate together on the same machine, but that the AHaH computing processor may reduce the power consumption and processing time for certain adaptive learning tasks by orders of magnitude. The paper begins by drawing a connection between the properties of volatility, thermodynamics, and Anti-Hebbian and Hebbian (AHaH) plasticity. We show how AHaH synaptic plasticity leads to attractor states that extract the independent components of applied data streams and how they form a computationally complete set of logic functions. After introducing a general memristive device model based on collections of metastable switches, we show how adaptive synaptic weights can be formed from differential pairs of incremental memristors. We also disclose how arrays of synaptic weights can be used to build a neural node circuit operating AHaH plasticity. By configuring the attractor states of the AHaH node in different ways, high level machine learning functions are demonstrated. This includes unsupervised clustering, supervised and unsupervised classification, complex signal prediction, unsupervised robotic actuation and combinatorial optimization of procedures-all key capabilities of biological nervous systems and modern machine learning algorithms with real world application.
Overview
CoChat Summary
# TL;DR
This paper introduces AHaH computing, an adaptive architecture that combines memory and processing using volatile, dissipative memristive devices and AHaH plasticity. Across software simulations, the authors report that AHaH nodes can support clustering, classification, signal prediction, robotic control, combinatorial optimization, and computationally complete logic.
# Key findings
- The paper argues that AHaH plasticity emerges from competing dissipative pathways and yields attractor states that can implement universal logic and machine learning functions.
- In clustering experiments, the AHaH clusterer was reported to achieve perfect performance with up to 18% noise at 100% pattern load, and greater than 90% vergence with up to 44% noise; at 200% pattern load, vergence fell below 90% after 12.5% noise.
- In classification benchmarks on Breast Cancer Wisconsin (Original), Census Income, MNIST Handwritten Digits, and Reuters-21578, the authors report that AHaH results “compare well” and “consistently match or exceed SVM performance.”
- For a temporal signal prediction proof of concept, the predictor was trained for 10,000 time steps and recursively predicted 300 steps into the future; for robotic arm control, the AHaH-guided arm was evaluated by the average total joint actuation needed to capture 100 moving targets.
# Methods
- All experiments were software simulations of AHaH nodes in Java; the paper states the code is open-sourced and tagged `PLOS_AHAH` on the master branch.
- The study used both functional and circuit models, with circuit simulations based on ideal components and a generalized memristive device model fitted to Ag-chalcogenide, AIST, GST, and WOx data; all AHaH node circuitry simulations used Ag-chalcogenide parameters unless otherwise noted.
- Main analyses included parameter sweeps for clustering, standard benchmark evaluation for classification, temporal prediction on a synthetic five-sinusoid signal, robotic arm control in a virtual environment, and strike-search optimization on a 64-city traveling salesman setup.
# Limitations
- The paper explicitly says it was not possible, given the broad scope, to provide much elaboration on some results, comparison with many other methods, or discussion of implications; it therefore open-sourced the code instead.
- The authors state that nonideal circuit effects such as parasitic impedances, signal delays, settling times, and memristor variability were not modeled, and should be addressed in future work.
- Evident from the text: most evidence is from simulations rather than physical hardware experiments, and the authors themselves note that experiments on physical devices had “not yet been carried out” for at least one memristor-series simulation result.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures




















Verification
Claims the paper makes
6 Valid · 18 Not valid · 21 Not checked · 183 Own results and interpretations
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“The modern memristor provides us with just such an adaptive pathway.”
§ AHaH Computing–From Metastable Switches to Attractors to Machine Learning > Theory > AHaH Memristor Circuit
What the sources say
- Not checked — no full text of the sourcecites [68] SH Jo, 2010, Nanoscale memristor device as synapse in neuromorphic systems, Nano Letters source
- Supportedcites [83] A Thomas, 2013, Memristor-based neural networks, Journal of Physics D: Applied Physics source
The Conclusions state that a memristor can realise synaptic behaviour, enabling adaptive analogue computer systems. This supports the claim that the memristor provides an adaptive pathway. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Several synapse-like memristors achieving ultra-low power pulsed synaptic updates have recently been reported [68], [70], [113].”
§ AHaH Computing–From Metastable Switches to Attractors to Machine Learning > Results and Discussion > Synaptic Power Consumption
What the sources say
- Not checked — no full text of the sourcecites [68] SH Jo, 2010, Nanoscale memristor device as synapse in neuromorphic systems, Nano Letters source
- Partly supportedcites [70] Li Y, Zhong Y, Xu L, Zhang J, Xu X, <etal>et al</etal>.. (2013) Ultrafast synaptic events in a chalcogenide memristor. Scientific Reports 3 doi:10.1038/srep01619. sourceExperimental — accuracy not yet measured
The Results section (‘Modification of synaptic efficacy and implementation of ultrafast STDP’; page unavailable) reports synaptic-weight updates using 30-ns electrical pulses in a chalcogenide memristor. The copy does not establish ultra-low power consumption for those updates; the Abstract’s picojoule-level figure describes an earlier study, not this device. (LLM, conf=0.78)
- Not checked — no full text of the sourcecites [113] D Kuzum, 2011, Nanoelectronic programmable synapses based on phase change materials for brain-inspired computing, Nano Letters source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“The energy consumption per synapse using roughly average voltage, pulse width, and resistance values taken from the pulse-driven memristive behavior plots in the three references results in a calculated energy consumption per synapse per update of ∼12 pJ, ∼67.5 pJ, and ∼56 pJ respectively.”
§ AHaH Computing–From Metastable Switches to Attractors to Machine Learning > Results and Discussion > Synaptic Power Consumption
What the sources say
- Not checked — no full text of the sourcecites [68] SH Jo, 2010, Nanoscale memristor device as synapse in neuromorphic systems, Nano Letters source
- Supportedcites [70] Li Y, Zhong Y, Xu L, Zhang J, Xu X, <etal>et al</etal>.. (2013) Ultrafast synaptic events in a chalcogenide memristor. Scientific Reports 3 doi:10.1038/srep01619. source
The Results section (page unavailable) gives the voltage, 30-ns pulse width, and roughly 2.2–3.0 kΩ resistance values used for synaptic-weight updates. Those values permit a roughly 12-pJ-per-update estimate; the citing sentence presents the energy figure as its own calculation, not as a number reported by Li et al. (LLM, conf=0.84)
- Not checked — no full text of the sourcecites [113] D Kuzum, 2011, Nanoelectronic programmable synapses based on phase change materials for brain-inspired computing, Nano Letters source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After introducing a general memristive device model based on collections of metastable switches, we show how adaptive synaptic weights can be formed from differential pairs of incremental memristors.”
§ AHaH Computing–From Metastable Switches to Attractors to Machine Learning > Abstract
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We further show that AHaH plasticity can be attained from simple memristive circuitry attempting to maximize circuit power dissipation in accordance with ideas in nonequilibrium thermodynamics.”
§ AHaH Computing–From Metastable Switches to Attractors to Machine Learning > Introduction
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- Rests on an assumption not shown here.
116 more claims
Create a free account to see all 228 claims and to verify the 1 reference still open.
- It may state two separate claims as one. 48
- Probably not a substantial claim. 76
- The quote only partly states this claim. 4
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As we have reported elsewhere [Nugent and W 2014], the binary encoding of a collection of AHaH nodes operating the FF-RU instruction can be used as the basis of a clustering algorithm.”
From From memristors to compositional machine learning: exploring neuromemristive algorithmic abstractions with the knowm API (2017) · cites this paper as Nugent and W 2014
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“The kT-RAM technology specification [Nugent and Molter 2017] describes multiple levels of abstraction and specialization needed to implement an Anti-Hebbian and Hebbian (AHaH) computing [Nugent and W 2014] compliant synaptic processor and integrate it into digital computing systems.”
From From memristors to compositional machine learning: exploring neuromemristive algorithmic abstractions with the knowm API (2017) · cites this paper as Nugent and W 2014
The cited source says what the claim attributes to it.
In the citing paper
“The result is an attractor state where the decision boundary splits the opposing distributions cleanly, forming a natural boundary that increases noise-tolerance and coincides with statistical techniques such as ICA and support vector maximization between pattern classes [Nugent and W 2014].”
From From memristors to compositional machine learning: exploring neuromemristive algorithmic abstractions with the knowm API (2017) · cites this paper as Nugent and W 2014
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
(1967) · Cited by 23,719
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Research works printed but not linked: 5
- Widrow B (1987) The original adaptive neural net broom-balancer. In: Proc. 1987 IEEE International Symposium on Circuits and Systems. volume 2, 351–357.
- Minsky M, Seymour P (1969) Perceptrons. MIT press.
- Mead C, Conway L (1980) Introduction to VLSI Systems. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc.
- Klimo M, Such O (2012) Fuzzy computer architecture based on memristor circuits. In: Proc. 2012 4th International Conference on Future Computational Technologies and Applications. 84–87.
- M Athelogou, 1989, Extremal properties of dendritic patterns: biological applications, Helvetica Physica Acta, 62, 250
Cited by
Survey of Machine Learning Accelerators
Reuther, A., Michaleas, P., Jones, M., Gadepally, V., Samsi, S., & Kepner, J. (2020) · 2020 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec43674.2020.9286149 · Cited by 163
Memristors for the Curious Outsiders
Carbajal, J. P., & Caravelli, F. (2018) · Technologies · doi:10.3390/technologies6040118 · Cited by 82
Krestinskaya, O., Choubey, B., & James, A. P. (2020) · Scientific Reports · doi:10.1038/s41598-020-62676-7 · Cited by 63
Structural and Parametric Identification of Knowm Memristors
Ostrovskii, V. Y., Fedoseev, P. S., Bobrova, Y. O., & Бутусов, Д. (2021) · Nanomaterials · doi:10.3390/nano12010063 · Cited by 54
Open source libraries and frameworks for biological data visualisation: A guide for developers
Wang, R., Pérez‐Riverol, Y., Hermjakob, H., & Vizcaíno, J. A. (2014) · PROTEOMICS · doi:10.1002/pmic.201400377 · Cited by 58
Metadata
- Authors
- Nugent, M. A., & Molter, T. W.
- Affiliations
- M. Alexander Nugent Consulting (United States) (US)
- Corresponding author
- Nugent, Michael Alexander
- Molter, Timothy Wesley
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2014-02-10
- Volume
- 9
- Issue
- 2
- Pages
- e85175
- ISSN
- 1932-6203 (ISSN-L)
- PMC
- PMC3919716
- OpenAlex
- W2035408474
- Semantic Scholar
- 1f85abd081b9cc423d79d0f9e3c3dccbfc14c9c7
- Cited by
- 55
- References
- 131
- Citations by year
- 2026: 5 · 2025: 5 · 2024: 2 · 2023: 4 · 2022: 4 · 2021: 7 · 2020: 5 · 2019: 6 · 2018: 5 · 2017: 5 · 2016: 4 · 2015: 1 · 2014: 2
- FWCI
- 2.10
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- PLoS ONE (publishedVersion, cc-by)
- PubMed (publishedVersion)
- Europe PMC (PubMed Central) (submittedVersion, cc-by)
- PubMed Central (submittedVersion, cc-by)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Figshare (submittedVersion, cc-by)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
- Life Sciences › Neuroscience › Cellular and Molecular Neuroscience › Photoreceptor and optogenetics research
- Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
- Keywords
- von Neumann bottleneck, attractor dynamics, memristors, synaptic plasticity, Hebbian plasticity, anti-Hebbian plasticity, independent component analysis, unsupervised clustering
- MeSH terms
- Algorithms, Artificial Intelligence, Computer Simulation, Electric Conductivity, Electronics, Models, Theoretical, Robotics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-09-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-09-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: AHaH Computing–From Metastable Switches to Attractors to Machine Learning. https://app.cochat.ai/papers/10.1371/journal.pone.0085175
- The paper
- Nugent, M. A., & Molter, T. W. (2014). AHaH Computing–From Metastable Switches to Attractors to Machine Learning. PLoS ONE. https://doi.org/10.1371/journal.pone.0085175
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.