P systems based computing polynomials: Design and formal verification

TitleP systems based computing polynomials: Design and formal verification
Publication TypeConference Contributions
Year of Publication2015
AuthorsYuan, W., Zhang G., Pérez-Jiménez M. J., Wang T., & Huan Z.
Conference NameAsian Conference on Membrane Computing (ACMC 2015)
Volume TitleProceedings of the Asian Conference on Membrane Computing (ACMC 2015)
Volume1
Pages1-9
Date Published11/2015
Abstract

Automatic design of P systems is an attractive research topic
in the community of membrane computing. Differing from the previous
work that used evolutionary algorithms to fulfill the task, this paper
presents the design of a simple (deterministic transition) P system
(without input membrane) of degree 1, capturing the value of the korder
(k ≥ 2) polynomial by using a reasoning method. Specifically, the
values of polynomial p(n) corresponding to a natural number t is equal
to the multiplicity of a distinguished object of the system (the output
object) in the configuration at instant t. We also discuss the descriptive
computational resources required by the designed k-order polynomial P
system

Keywordsautomatic design, Membrane computing, P system, polynomial
URLhttp://www.cs.us.es/~marper/investigacion/P%20system%20solving%20polynomial%20problem.pdf