On the Computational Complexity of Networks of Spiking Neurons
Abstract
We investigate the computational power of a formal model for net(cid:173) works of spiking neurons, both for the assumption of an unlimited timing precision, and for the case of a limited timing precision. We also prove upper and lower bounds for the number of examples that are needed to train such networks.
Cite
Text
Maass. "On the Computational Complexity of Networks of Spiking Neurons." Neural Information Processing Systems, 1994.Markdown
[Maass. "On the Computational Complexity of Networks of Spiking Neurons." Neural Information Processing Systems, 1994.](https://mlanthology.org/neurips/1994/maass1994neurips-computational/)BibTeX
@inproceedings{maass1994neurips-computational,
title = {{On the Computational Complexity of Networks of Spiking Neurons}},
author = {Maass, Wolfgang},
booktitle = {Neural Information Processing Systems},
year = {1994},
pages = {183-190},
url = {https://mlanthology.org/neurips/1994/maass1994neurips-computational/}
}