Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Nugent, Michael Alexander, Molter, Timothy Wesley · 2014 · PLoS ONE

Abstract

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

Crossref · 10.1371/journal.pone.0085175

Cites

127 of 127 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Figure 1 AHaH process. A) A first replenished pressurized container is allowed to diffuse into two non-pressurized empty containers and though a region of matter M. B) The gradient reduces faster than the gradient due to the conductance differential. C) This causes to grow more than , reducing the conductance differential and leading to anti-Hebbian learning. D) The first detectable signal (work) is available at owing to the differential that favors it. As a response to this signal, events may transpire in the environment that open up new pathways to particle dissipation. The initial conductance differential is reinforced leading to Hebbian learning.
Figure 1 AHaH process. A) A first replenished pressurized container is allowed to diffuse into two non-pressurized empty containers and though a region of matter M. B) The gradient reduces faster than the gradient due to the conductance differential. C) This causes to grow more than , reducing the conductance differential and leading to anti-Hebbian learning. D) The first detectable signal (work) is available at owing to the differential that favors it. As a response to this signal, events may transpire in the environment that open up new pathways to particle dissipation. The initial conductance differential is reinforced leading to Hebbian learning.CC BY · PubMed Central
Figure 2 Attractor states of a two-input AHaH node. The AHaH rule naturally forms decision boundaries that maximize the margin between data distributions (black blobs). This is easily visualized in two dimensions, but it is equally valid for any number of inputs. Attractor states are represented by decision boundaries A, B, C (green dotted lines) and D (red dashed line). Each state has a corresponding anti-state: . State A is the null state and its occupation is inhibited by the bias. State D has not yet been reliably achieved in circuit simulations.
Figure 2 Attractor states of a two-input AHaH node. The AHaH rule naturally forms decision boundaries that maximize the margin between data distributions (black blobs). This is easily visualized in two dimensions, but it is equally valid for any number of inputs. Attractor states are represented by decision boundaries A, B, C (green dotted lines) and D (red dashed line). Each state has a corresponding anti-state: . State A is the null state and its occupation is inhibited by the bias. State D has not yet been reliably achieved in circuit simulations.CC BY · PubMed Central
Figure 3 Universal reconfigurable logic. By connecting the output of AHaH nodes (circles) to the input of static NAND gates, one may create a universal reconfigurable logic gate by configuring the AHaH node attractor states (). The structure of the data stream on binary encoded channels and support AHaH attractor states (Figure 2). Through configuration of node attractor states the logic function of the circuit can be configured and all logic functions are possible. If inputs are represented as a spike encoding over four channels then AHaH node attractor states can attain all logic functions without the use of NAND gates.
Figure 3 Universal reconfigurable logic. By connecting the output of AHaH nodes (circles) to the input of static NAND gates, one may create a universal reconfigurable logic gate by configuring the AHaH node attractor states (). The structure of the data stream on binary encoded channels and support AHaH attractor states (Figure 2). Through configuration of node attractor states the logic function of the circuit can be configured and all logic functions are possible. If inputs are represented as a spike encoding over four channels then AHaH node attractor states can attain all logic functions without the use of NAND gates.CC BY · PubMed Central
Figure 4 A differential pair of memristors forms a synapse. A differential pair of memristors is used to form a synaptic weight, allowing for both a sign and magnitude. The bar on the memristor is used to indicate polarity and corresponds to the lower potential end when driving the memristor into a higher conductance state. and form a voltage divider causing the voltage at node y to be some value between and . When driven correctly in the absence of Hebbian feedback a synapse will evolve to a symmetric state where V, alleviating issues arising from device inhomogeneities.
Figure 4 A differential pair of memristors forms a synapse. A differential pair of memristors is used to form a synaptic weight, allowing for both a sign and magnitude. The bar on the memristor is used to indicate polarity and corresponds to the lower potential end when driving the memristor into a higher conductance state. and form a voltage divider causing the voltage at node y to be some value between and . When driven correctly in the absence of Hebbian feedback a synapse will evolve to a symmetric state where V, alleviating issues arising from device inhomogeneities.CC BY · PubMed Central
Figure 5 AHaH 2-1 two-phase circuit diagram. The circuit produces an analog voltage signal on the output at node y given a spike pattern on its inputs labeled , , . The bias inputs , , are equivalent to the spike pattern inputs except that they are always active when the spike pattern inputs are active. F is a voltage source used to implement supervised and unsupervised learning via the AHaH rule. The polarity of the memristors for the bias synapse(s) is inverted relative to the input memristors. The output voltage, , contains both state (positive/negative) and confidence (magnitude) information.
Figure 5 AHaH 2-1 two-phase circuit diagram. The circuit produces an analog voltage signal on the output at node y given a spike pattern on its inputs labeled , , . The bias inputs , , are equivalent to the spike pattern inputs except that they are always active when the spike pattern inputs are active. F is a voltage source used to implement supervised and unsupervised learning via the AHaH rule. The polarity of the memristors for the bias synapse(s) is inverted relative to the input memristors. The output voltage, , contains both state (positive/negative) and confidence (magnitude) information.CC BY · PubMed Central
Figure 6 Circuit voltages across memristors during the read and write phases. A) Voltages during read phase across spike input memristors. B) Voltages during write phase across spike input memristors. C) Voltages during read phase across bias memristors. D) Voltages during write phase across bias memristors.
Figure 6 Circuit voltages across memristors during the read and write phases. A) Voltages during read phase across spike input memristors. B) Voltages during write phase across spike input memristors. C) Voltages during read phase across bias memristors. D) Voltages during write phase across bias memristors.CC BY · PubMed Central
Figure 7 Generalized Metastable Switch (MSS). An MSS is an idealized two-state element that switches probabilistically between its two states as a function of applied voltage bias and temperature. The probability that the MSS will transition from the B state to the A state is given by , while the probability that the MSS will transition from the A state to the B state is given by . We model a memristor as a collection of MSSs evolving over discrete time steps.
Figure 7 Generalized Metastable Switch (MSS). An MSS is an idealized two-state element that switches probabilistically between its two states as a function of applied voltage bias and temperature. The probability that the MSS will transition from the B state to the A state is given by , while the probability that the MSS will transition from the A state to the B state is given by . We model a memristor as a collection of MSSs evolving over discrete time steps.CC BY · PubMed Central
Figure 8 Generalized memristive device model simulations. A) Solid line represents the model simulated at 100 Hz and dots represent the measurements from a physical Ag-chalcogenide device from Boise State University. Physical and predicted device current resulted from driving a sinusoidal voltage of 0.25 V amplitude at 100 Hz across the device. B) Simulation of two series-connected arbitrary devices with differing model parameter values. C) Simulated response to pulse trains of {10 μs, 0.2 V, −0.5 V}, {10 μs, 0.8 V, −2.0 V}, and {5 μs, 0.8 V, −2.0 V} showing the incremental change in resistance in response to small voltage pulses. D) Simulated time response of model from driving a sinusoidal voltage of 0.25 V amplitude at 100 Hz, 150 Hz, and 200 Hz. E) Simulated response to a triangle wave of 0.1 V amplitude at 100 Hz showing the expected incremental behavior of the model. F) Simulated and scaled hysteresis curves for the AIST, GST, and WOx devices (not to scale).
Figure 8 Generalized memristive device model simulations. A) Solid line represents the model simulated at 100 Hz and dots represent the measurements from a physical Ag-chalcogenide device from Boise State University. Physical and predicted device current resulted from driving a sinusoidal voltage of 0.25 V amplitude at 100 Hz across the device. B) Simulation of two series-connected arbitrary devices with differing model parameter values. C) Simulated response to pulse trains of {10 μs, 0.2 V, −0.5 V}, {10 μs, 0.8 V, −2.0 V}, and {5 μs, 0.8 V, −2.0 V} showing the incremental change in resistance in response to small voltage pulses. D) Simulated time response of model from driving a sinusoidal voltage of 0.25 V amplitude at 100 Hz, 150 Hz, and 200 Hz. E) Simulated response to a triangle wave of 0.1 V amplitude at 100 Hz showing the expected incremental behavior of the model. F) Simulated and scaled hysteresis curves for the AIST, GST, and WOx devices (not to scale).CC BY · PubMed Central
Figure 9 Unsupervised robotic arm challenge. The robotic arm challenge involves a multi-jointed robotic arm that moves to capture a target. Each joint on the arm has 360 degrees of rotation, and the base joint is anchored to the floor. Using only a value signal relating the distance from the head to the target and an AHaH motor controller taking as input sensory stimuli in a closed-loop configuration, the robotic arm autonomously learns to capture stationary and moving targets. New targets are dropped within the arm’s reach radius after each capture, and the number of discrete angular joint actuations required for each catch is recorded to asses capture efficiency.
Figure 9 Unsupervised robotic arm challenge. The robotic arm challenge involves a multi-jointed robotic arm that moves to capture a target. Each joint on the arm has 360 degrees of rotation, and the base joint is anchored to the floor. Using only a value signal relating the distance from the head to the target and an AHaH motor controller taking as input sensory stimuli in a closed-loop configuration, the robotic arm autonomously learns to capture stationary and moving targets. New targets are dropped within the arm’s reach radius after each capture, and the number of discrete angular joint actuations required for each catch is recorded to asses capture efficiency.CC BY · PubMed Central
Figure 10 The AHaH rule reconstructed from simulations. Each data point represents the change in a synaptic weight as a function of AHaH node activation, y. Blue data points correspond to input synapses and red data points to bias inputs. There is good congruence between the A) functional and B) circuit implementations of the AHaH rule.
Figure 10 The AHaH rule reconstructed from simulations. Each data point represents the change in a synaptic weight as a function of AHaH node activation, y. Blue data points correspond to input synapses and red data points to bias inputs. There is good congruence between the A) functional and B) circuit implementations of the AHaH rule.CC BY · PubMed Central
Figure 11 Justification of constant weight conjugate. Multiple AHaH nodes receive spike patterns from the set while the weight and weight conjugate is measured. Blue = weight conjugate (), Red = weight (). The quantity has a much lower variance than the quantity over multiple trials, justifying the assumption that is a constant factor.
Figure 11 Justification of constant weight conjugate. Multiple AHaH nodes receive spike patterns from the set while the weight and weight conjugate is measured. Blue = weight conjugate (), Red = weight (). The quantity has a much lower variance than the quantity over multiple trials, justifying the assumption that is a constant factor.CC BY · PubMed Central
Figure 12 Attractor states of a two-input AHaH node under the three-pattern input. The AHaH rule naturally forms decision boundaries that maximize the margin between data distributions. Weight space plots show the initial weight coordinate (green circle), the final weight coordinate (red circle) and the path between (blue line). Evolution of weights from a random normal initialization to attractor basins can be clearly seen for both the functional model (A) and circuit model (B).
Figure 12 Attractor states of a two-input AHaH node under the three-pattern input. The AHaH rule naturally forms decision boundaries that maximize the margin between data distributions. Weight space plots show the initial weight coordinate (green circle), the final weight coordinate (red circle) and the path between (blue line). Evolution of weights from a random normal initialization to attractor basins can be clearly seen for both the functional model (A) and circuit model (B).CC BY · PubMed Central
Figure 13 AHaH attractor states as logic functions. A) Logic state occupation frequency after 5000 time steps for both functional model and circuit model. All logic functions can be attained directly from attractor states except for XOR functions, which can be attained via multi-stage circuits. B) The logic functions are stable over time for both functional model and circuit model, indicating stable attractor dynamics.
Figure 13 AHaH attractor states as logic functions. A) Logic state occupation frequency after 5000 time steps for both functional model and circuit model. All logic functions can be attained directly from attractor states except for XOR functions, which can be attained via multi-stage circuits. B) The logic functions are stable over time for both functional model and circuit model, indicating stable attractor dynamics.CC BY · PubMed Central
Figure 14 AHaH clusterer. Functional (A) and circuit (B) simulation results of an AHaH clusterer formed of twenty AHaH nodes. Spike patterns were encoded over 16 active input lines from a total spike space of 256. The number of noise bits was swept from 1 (6.25%) to 10 (62.5%) while the vergence was measured. The performance is a function of the total number of spike patterns. Blue = 16 (100% load), Orange = 20 (125% load), Purple = 24 (150% load), Green = 32 (200% load), Red = 64 (400% load).
Figure 14 AHaH clusterer. Functional (A) and circuit (B) simulation results of an AHaH clusterer formed of twenty AHaH nodes. Spike patterns were encoded over 16 active input lines from a total spike space of 256. The number of noise bits was swept from 1 (6.25%) to 10 (62.5%) while the vergence was measured. The performance is a function of the total number of spike patterns. Blue = 16 (100% load), Orange = 20 (125% load), Purple = 24 (150% load), Green = 32 (200% load), Red = 64 (400% load).CC BY · PubMed Central
Figure 15 Two-dimensional spatial clustering demonstrations. The AHaH clusterer performs well across a wide range of different 2D spatial cluster types, all without predefining the number of clusters or the expected cluster types. A) Gaussian B) non-Gaussian C) random Gaussian size and placement.
Figure 15 Two-dimensional spatial clustering demonstrations. The AHaH clusterer performs well across a wide range of different 2D spatial cluster types, all without predefining the number of clusters or the expected cluster types. A) Gaussian B) non-Gaussian C) random Gaussian size and placement.CC BY · PubMed Central
Figure 16 Classification benchmarks results. A) Reuters-21578. Using the top ten most frequent labels associated with the news articles in the Reuters-21578 data set, the AHaH classifier’s accuracy, precision, recall, and F1 score was determined as a function of its confidence threshold. As the confidence threshold increases, the precision increases while recall drops. An optimal confidence threshold can be chosen depending on the desired results and can be dynamically changed. The peak F1 score is 0.92. B) Census Income. The peak F1 score is 0.853 C) Breast Cancer. The peak F1 score is 0.997. D) Breast Cancer repeated but using the circuit model rather than the functional model. The peak F1 score and the shape of the curves are similar to functional model results. E) MNIST. The peak F1 score is 0.98–.99, depending on the resolution of the spike encoding. F) The individual F1 classification scores of the hand written digits.
Figure 16 Classification benchmarks results. A) Reuters-21578. Using the top ten most frequent labels associated with the news articles in the Reuters-21578 data set, the AHaH classifier’s accuracy, precision, recall, and F1 score was determined as a function of its confidence threshold. As the confidence threshold increases, the precision increases while recall drops. An optimal confidence threshold can be chosen depending on the desired results and can be dynamically changed. The peak F1 score is 0.92. B) Census Income. The peak F1 score is 0.853 C) Breast Cancer. The peak F1 score is 0.997. D) Breast Cancer repeated but using the circuit model rather than the functional model. The peak F1 score and the shape of the curves are similar to functional model results. E) MNIST. The peak F1 score is 0.98–.99, depending on the resolution of the spike encoding. F) The individual F1 classification scores of the hand written digits.CC BY · PubMed Central
Figure 17 Semi-supervised operation of the AHaH classifier. For the first 30% of samples from the Reuters-21578 data set, the AHaH classifier was operated in supervised mode followed by operation in unsupervised mode for the remaining samples. A confidence threshold of 1.0 was set for unsupervised application of a learn signal. The F1 score for the top ten most frequently occurring labels in the Reuters-21578 data set were tracked. These results show that the AHaH classifier is capable of continuously improving its performance without supervised feedback.
Figure 17 Semi-supervised operation of the AHaH classifier. For the first 30% of samples from the Reuters-21578 data set, the AHaH classifier was operated in supervised mode followed by operation in unsupervised mode for the remaining samples. A confidence threshold of 1.0 was set for unsupervised application of a learn signal. The F1 score for the top ten most frequently occurring labels in the Reuters-21578 data set were tracked. These results show that the AHaH classifier is capable of continuously improving its performance without supervised feedback.CC BY · PubMed Central
Figure 18 Complex signal prediction with the AHaH classifier. By posing prediction as a multi-label classification problem, the AHaH classifier can learn complex temporal waveforms and make extended predictions via recursion. Here, the temporal signal (dots) is a summation of five sinusoidal signals with randomly chosen amplitudes, periods, and phases. The classifier is trained for 10,000 time steps (last 100 steps shown, dotted line) and then tested for 300 time steps (solid line).
Figure 18 Complex signal prediction with the AHaH classifier. By posing prediction as a multi-label classification problem, the AHaH classifier can learn complex temporal waveforms and make extended predictions via recursion. Here, the temporal signal (dots) is a summation of five sinusoidal signals with randomly chosen amplitudes, periods, and phases. The classifier is trained for 10,000 time steps (last 100 steps shown, dotted line) and then tested for 300 time steps (solid line).CC BY · PubMed Central
Figure 19 Unsupervised robotic arm challenge. The average total joint actuation required for the robot arm to capture the target remains constant as the number of arm joints increases for actuation using the AHaH motor controller. For random actuation, the required actuation grows exponentially.
Figure 19 Unsupervised robotic arm challenge. The average total joint actuation required for the robot arm to capture the target remains constant as the number of arm joints increases for actuation using the AHaH motor controller. For random actuation, the required actuation grows exponentially.CC BY · PubMed Central
Figure 20 64-city traveling salesman experiment. By using single-input AHaH nodes as nodes in a routing tree to perform a strike search, combinatorial optimization problems such as the traveling salesman problem can be solved. Adjusting the learning rate can control the speed and quality of the solution. A) The distance between the 64 cities versus the convergences time for the AHaH-based and random-based strike search. B) Lower learning rates lead to better solutions. C) Higher learning rates decrease convergence time.
Figure 20 64-city traveling salesman experiment. By using single-input AHaH nodes as nodes in a routing tree to perform a strike search, combinatorial optimization problems such as the traveling salesman problem can be solved. Adjusting the learning rate can control the speed and quality of the solution. A) The distance between the 64 cities versus the convergences time for the AHaH-based and random-based strike search. B) Lower learning rates lead to better solutions. C) Higher learning rates decrease convergence time.CC BY · PubMed Central

Verification

Claims the paper makes

6 Valid · 18 Not valid · 21 Not checked · 183 Own results and interpretations

116 more claims

Create a free account to see all 228 claims and to verify the 1 reference still open.

See all claims — free account
  • It may state two separate claims as one. 48
  • Probably not a substantial claim. 76
  • The quote only partly states this claim. 4

Create a free account to see these claims.

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?

Citations

Cites

Show all 131 references

Research works printed but not linked: 5

  1. Widrow B (1987) The original adaptive neural net broom-balancer. In: Proc. 1987 IEEE International Symposium on Circuits and Systems. volume 2, 351–357.
  2. Minsky M, Seymour P (1969) Perceptrons. MIT press.
  3. Mead C, Conway L (1980) Introduction to VLSI Systems. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc.
  4. 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.
  5. M Athelogou, 1989, Extremal properties of dendritic patterns: biological applications, Helvetica Physica Acta, 62, 250

Cited by

See all 55

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
Published
2014-02-10
Volume
9
Issue
2
Pages
e85175
ISSN
1932-6203 (ISSN-L)
OpenAlex
W2035408474
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
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.