On the computational complexity of spiking neural P systems |
| |
Authors: | Turlough Neary |
| |
Affiliation: | (1) Boole Centre for Research in Informatics, University College Cork, Cork, Ireland |
| |
Abstract: | It is shown here that there is no standard spiking neural P system that simulates Turing machines with less than exponential time and space overheads. The spiking neural P systems considered here have a constant number of neurons that is independent of the input length. Following this, we construct a universal spiking neural P system with exhaustive use of rules that simulates Turing machines in linear time and has only 10 neurons. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|