On a Păun's Conjecture in Membrane Systems

Authors:
Giancarlo Mauri;Mario J. Pérez-Jiménez;Claudio Zandron
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione. Universitá di Milano---Bicocca, via Bicocca degli Arcimboldi 8, I---20126, Milano, Italy;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence. University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain;Dipartimento di Informatica, Sistemistica e Comunicazione. Universitá di Milano---Bicocca, via Bicocca degli Arcimboldi 8, I---20126, Milano, Italy
Venue:
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Year:
2007

Citing 9
Cited 2

P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Solving NP-Complete Problems Using P Systems with Active Membranes

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
The computational power of cell division in P systems: Beating down parallel computers?

Natural Computing: an international journal
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
P systems with minimal parallelism

Theoretical Computer Science
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
Proceedings of the 5th international conference on Membrane Computing

WMC'04 Proceedings of the 5th international conference on Membrane Computing
Attacking the common algorithmic problem by recognizer p systems

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Membrane Dissolution and Division in P

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a Păun's conjecture concerning the unsolvability of NP---complete problems by polarizationless P systems with active membranes in the usual framework, without cooperation, without priorities, without changing labels, using evolution, communication, dissolution and division rules, and working in maximal parallel manner. We also analyse a version of this conjecture where we consider polarizationless P systems working in the minimally parallel manner.