No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory.
René NdoundamMartín MatamalaPublished in: Complex Syst. (2000)
Keyphrases
- upper bound
- lower bound
- finite automata
- memory requirements
- memory size
- regular expressions
- cellular automata
- finite state
- spiking neural networks
- error bounds
- worst case
- probabilistic automata
- random access
- memory space
- limited memory
- lattice gas
- objective function
- randomized approximation
- motor control
- low order
- computing power
- finite state machines
- np hard