- 期刊
POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMS
摘要
The paper introduces a formal framework for the study of computational power of spiking neural (SN) P systems. We define complexity classes of uniform families of recognizer SN P systems with and without input, in a way which is standard in P systems theory. Then we study properties of the resulting complexity classes, extending previous results on SN P systems. We demonstrate that the computational power of several variants of confluent SN P systems, under polynomial time restriction, is characterized by classes ranging from P to PSPACE.
延伸閱讀
- Ji, Z., Wu, W., Feng, Y., & Zhang, G. (2013). Constructing the Lyapunov Function through Solving Positive Dimensional Polynomial System. Journal of Applied Mathematics, 2013(), 694-698-771. https://doi.org/10.1155/2013/859578
- Poghosyan, A. (2013). On a Fast Convergence of the Rational-Trigonometric-Polynomial Interpolation. Advances in Numerical Analysis, 2013(), 1-13-005. https://doi.org/10.1155/2013/315748
- MARLOWE, T. J., & SCHOPPMANN, L. (1998). Polynomial-Time Computability of the Edge-Reliability of Graphs Using Gilbert's Formula. Mathematical Problems in Engineering, 1998(), 247-266. https://doi.org/10.1155/S1024123X98000817
- Su, J. H. (2005). A study of invariant theory and generalized symmetric polynomial [master's thesis, Tamkang University]. Airiti Library. https://doi.org/10.6846/TKU.2005.00007
- Boudellioua, M. S. (2007). Controllable and Observable Polynomial Description for 2D Noncausal Systems. Journal of Control Science and Engineering, 2007(), 66-70. https://doi.org/10.1155/2007/87171