Computing with truly asynchronous threshold logic networks

DOI10.1016/S0304-3975(96)00017-5MaRDI QIDQ1269908zbMATH OpenOpenAlexFDO

Authors Pekka Orponen

Publication date 22 October 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(96)00017-5

zbMATH Keywords

Hopfield netsimulation mechanisms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1490012
• scientific article; zbMATH DE number 4150096
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
• Computing with continuous-time Liapunov systems
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

Cites work

• A generalized convergence theorem for neural networks
• Analog computation via neural networks
• Comportement périodique des fonctions à seuil binaires et applications
• Decreasing energy functions as a tool for studying threshold networks
• Fixed Point Behavior of Threshold Functions on a Finite Set
• scientific article; zbMATH DE number 4201673 (Why is no real title available?)
• scientific article; zbMATH DE number 4155875 (Why is no real title available?)
• scientific article; zbMATH DE number 19763 (Why is no real title available?)
• scientific article; zbMATH DE number 45557 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 49141 (Why is no real title available?)
• scientific article; zbMATH DE number 754673 (Why is no real title available?)
• scientific article; zbMATH DE number 872005 (Why is no real title available?)
• Neural networks and physical systems with emergent collective computational abilities
• On periodical behaviour in societies with symmetric influences
• Sequential simulation of parallel iterations and applications
• Simple Local Search Problems that are Hard to Solve
• The convergence of symmetric threshold automata
• Transient length in sequential iteration of threshold functions

Cited in

(12)

• Pure Nash equilibria in player-specific and weighted congestion games
• Asynchronous threshold networks
• Analog neuron hierarchy
• Subrecursive neural networks
• Asynchronous threshold networks with multisorted signals
• On the cost of simulating a parallel Boolean automata network by a block-sequential one
• scientific article; zbMATH DE number 4150096 (Why is no real title available?)
• About non-monotony in Boolean automata networks
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Energy complexity of recurrent neural networks
• Computation in gene networks
• Three analog neurons are Turing universal

This page was built for publication: Computing with truly asynchronous threshold logic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269908)