Lower Bounds for the Computational Power of Networks of Spiking Neurons
From MaRDI portal
Publication:4880197
DOI10.1162/neco.1996.8.1.1zbMath0843.68104OpenAlexW1967983190MaRDI QIDQ4880197
Publication date: 5 June 1996
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco.1996.8.1.1
Related Items (22)
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Adaptive Synchronization of Activities in a Recurrent Network ⋮ Robust spike-train learning in spike-event based weight update ⋮ Adaptive learning rate of SpikeProp based on weight convergence analysis ⋮ Learning hierarchically-structured concepts ⋮ Spike-Timing-Dependent Construction ⋮ Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors ⋮ Toward Unified Hybrid Simulation Techniques for Spiking Neural Networks ⋮ Parallel computation in spiking neural nets ⋮ On the relevance of time in neural computation and learning ⋮ Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations ⋮ Robust learning in SpikeProp ⋮ Investigating the computational power of spiking neurons with non-standard behaviors ⋮ Spike-Timing Error Backpropagation in Theta Neuron Networks ⋮ Accelerating Event-Driven Simulation of Spiking Neurons with Multiple Synaptic Time Constants ⋮ Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. ⋮ Learning Beyond Finite Memory in Recurrent Networks of Spiking Neurons ⋮ On the Algorithmic Power of Spiking Neural Networks ⋮ On computation with pulses ⋮ Spiking neural nets with symbolic internal state ⋮ Shattering All Sets of ‘k’ Points in “General Position” Requires (k — 1)/2 Parameters ⋮ Spiking neurons and the induction of finite state machines.
Cites Work
This page was built for publication: Lower Bounds for the Computational Power of Networks of Spiking Neurons
