6 research outputs found
Universal P Systems: One Catalyst Can Be Suficient
Whether P systems with only one catalyst can already be universal, is still
an open problem. Here we establish universality (computational completeness) by using
speci c variants of additional control mechanisms. At each step using only multiset rules
from one set of a nite number of sets of rules allows for obtaining computational completeness
with one catalyst and only one membrane. If the targets are used for choosing
the multiset of rules to be applied, for getting computational completeness with only
one catalyst more than one membrane is needed. If the available sets of rules change
periodically with time, computational completeness can be obtained with one catalyst in
one membrane. Moreover, we also improve existing computational completeness results
for P systems with mobile catalysts and for P systems with membrane creation.Junta de AndalucĂa P08 â TIC 0420
Computational Completeness of P Systems Using Maximal Variants of the Set Derivation Mode
We consider P systems only allowing rules to be used in at most one copy
in each derivation step, especially the variant of the maximally parallel derivation mode
where each rule may only be used at most once. Moreover, we also consider the derivation
mode where from those sets of rules only those are taken which have the maximal number
of rules. We check the computational completeness proofs of several variants of P systems
and show that some of them even literally still hold true for the for these two new set
derivation modes. Moreover, we establish two new results for P systems using target
selection for the rules to be chosen together with these two new set derivation modes
Recommended from our members
Proceedings of the Workshop on Membrane Computing, WMC 2016.
yesThis Workshop on Membrane Computing, at the Conference of Unconventional
Computation and Natural Computation (UCNC), 12th July 2016, Manchester,
UK, is the second event of this type after the Workshop at UCNC 2015 in
Auckland, New Zealand*. Following the tradition of the 2015 Workshop the
Proceedings are published as technical report.
The Workshop consisted of one invited talk and six contributed presentations
(three full papers and three extended abstracts) covering a broad spectrum of
topics in Membrane Computing, from computational and complexity theory to
formal verification, simulation and applications in robotics. All these papers â
see below, but the last extended abstract, are included in this volume.
The invited talk given by Rudolf Freund, âP SystemsWorking in Set Modesâ,
presented a general overview on basic topics in the theory of Membrane Computing
as well as new developments and future research directions in this area.
Radu Nicolescu in âDistributed and Parallel Dynamic Programming Algorithms
Modelled on cP Systemsâ presented an interesting dynamic programming
algorithm in a distributed and parallel setting based on P systems enriched with
adequate data structure and programming concepts representation. Omar Belingheri,
Antonio E. Porreca and Claudio Zandron showed in âP Systems with
Hybrid Setsâ that P systems with negative multiplicities of objects are less powerful
than Turing machines. Artiom Alhazov, Rudolf Freund and Sergiu Ivanov
presented in âExtended Spiking Neural P Systems with Statesâ new results regading
the newly introduced topic of spiking neural P systems where states are
considered.
âSelection Criteria for Statistical Model Checkerâ, by Mehmet E. Bakir and
Mike Stannett, presented some early experiments in selecting adequate statistical
model checkers for biological systems modelled with P systems. In âTowards
Agent-Based Simulation of Kernel P Systems using FLAME and FLAME GPUâ,
Raluca Lefticaru, Luis F. MacĂas-Ramos, IonuĆŁ M. Niculescu, LaurenĆŁiu MierlÄ
presented some of the advatages of implementing kernel P systems simulations in
FLAME. Andrei G. Florea and CÄtÄlin Buiu, in âAn Efficient Implementation and Integration of a P Colony Simulator for Swarm Robotics Applications" presented an interesting and efficient implementation based on P colonies for swarms of Kilobot robots.
*http://ucnc15.wordpress.fos.auckland.ac.nz/workshop-on-membrane-computingwmc-
at-the-conference-on-unconventional-computation-natural-computation
Multi-Objective Binary PSO with Kernel P System on GPU
Computational cost is a big challenge for almost all intelligent algorithms which are run on CPU. In this regard, our proposed kernel P system multi-objective binary particle swarm optimization feature selection and classification method should perform with an efficient time that we aimed to settle via using potentials of membrane computing in parallel processing and nondeterminism. Moreover, GPUs perform better with latency-tolerant, highly parallel and independent tasks. In this study, to meet all the potentials of a membrane-inspired model particularly parallelism and to improve the time cost, feature selection method implemented on GPU. The time cost of the proposed method on CPU, GPU and Multicore indicates a significant improvement via implementing method on GPU