The second machine class: models of parallelism
Parallel computers and computations
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Complexity theory and genetics: the compuational power of crossing over
Information and Computation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
FCT '85 Fundamentals of Computation Theory
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes
Fundamenta Informaticae
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
On a Păun's Conjecture in Membrane Systems
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
Membrane Dissolution and Division in P
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Complexity aspects of polarizationless membrane systems
Natural Computing: an international journal
Uniform solution of QSAT using polarizationless active membranes
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Computational complexity aspects in membrane computing
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On a powerful class of non-universal P systems with active membranes
DLT'10 Proceedings of the 14th international conference on Developments in language theory
P systems with elementary active membranes: beyond NP and coNP
CMC'10 Proceedings of the 11th international conference on Membrane computing
An overview of membrane computing
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
P systems with active membranes: trading time for space
Natural Computing: an international journal
UC'05 Proceedings of the 4th international conference on Unconventional Computation
P systems with active membranes characterize PSPACE
DNA'06 Proceedings of the 12th international conference on DNA Computing
Membrane systems: a quick introduction
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
An approach to computational complexity in membrane computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
From cells to computers: membrane computing – a quick overview
DNA'04 Proceedings of the 10th international conference on DNA computing
A computational complexity theory in membrane computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
On the power of computing with proteins on membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
An efficient simulation of polynomial-space turing machines by p systems with active membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Membrane computing: power, efficiency, applications
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
P systems simulating oracle computations
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
Fundamenta Informaticae
Time-free solution to SAT problem using P systems with active membranes
Theoretical Computer Science
Space complexity equivalence of P systems with active membranes and Turing machines
Theoretical Computer Science
| Hi-index | 0.00 |
We study the computational power of cell division operations in the formalframework of P systems, a mathematical model of cell-like membrane structure with regulated transport of objects (molecules) through membranes. We show that a uniformfamily of P systems with active membranes and2-division is able to solve the well-known PSPACE-complete problem QBF inlinear time. This result implies that such a family of P systems modelling celldivision is at least as powerful as so-called Second Machine Class computers. The Second Machine Class, containing most of the fundamental parallelcomputer models such as parallel RAM machines of types SIMD and MIMD, vector machinesand others, is characterized by using an exponential amount of resources(processing units) with respect to the computing time.