Computing with truly asynchronous threshold logic networks

DOI10.1016/S0304-3975(96)00017-5zbMath0903.68162OpenAlexW1975776517MaRDI QIDQ1269908

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)

Related Items

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Subrecursive neural networks ⋮ About non-monotony in Boolean automata networks ⋮ Three analog neurons are Turing universal ⋮ Energy Complexity of Recurrent Neural Networks ⋮ On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One ⋮ Computation in gene networks ⋮ Analog neuron hierarchy ⋮ Pure Nash equilibria in player-specific and weighted congestion games

Cites Work

• Decreasing energy functions as a tool for studying threshold networks
• Sequential simulation of parallel iterations and applications
• Comportement périodique des fonctions à seuil binaires et applications
• Analog computation via neural networks
• Transient length in sequential iteration of threshold functions
• On periodical behaviour in societies with symmetric influences
• Simple Local Search Problems that are Hard to Solve
• A generalized convergence theorem for neural networks
• The convergence of symmetric threshold automata
• Fixed Point Behavior of Threshold Functions on a Finite Set
• Neural networks and physical systems with emergent collective computational abilities.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item