On the power of enzymatic numerical P systems

Cristian Ioan Vasile, Ana Brânduşa Pavel, Ioan Dumitrache, Gheorghe Pǎun

Research output: Contribution to journalArticlepeer-review

31 Scopus citations

Abstract

We study the computing power of a class of numerical P systems introduced in the framework of autonomous robot control, namely enzymatic numerical P systems. Three ways of using the evolution programs are investigated: sequential, all-parallel and one-parallel (with the same variable used in all programs or in only one, respectively); moreover, both deterministic and non-deterministic systems are considered. The Turing universality of some of the obtained classes of numerical P systems is proved (for polynomials with the smallest possible degree, one, also introducing a new proof technique in this area, namely starting the universality proof from the characterization of computable sets of numbers by means of register machines). The power of many other classes remains to be investigated.

Original languageEnglish
Pages (from-to)395-412
Number of pages18
JournalActa Informatica
Volume49
Issue number6
DOIs
StatePublished - Sep 2012
Externally publishedYes

Fingerprint

Dive into the research topics of 'On the power of enzymatic numerical P systems'. Together they form a unique fingerprint.

Cite this