Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balcazar JL, Diaz J and Gabarro J (1995) Structural Complexity I, Second Edition. Springer-Verlag, Berlin
Balcazar JL, Diaz J and Gabarro J (1991) Structural Complexity II. Springer-Verlag, Berlin
Goldberg DE (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (MA)
Goldschlager LM (1982) A universal interconnection pattern for parallel computers. J Assoc Comput Mach 29: 1073–1086
Kell DB (2002) Genotype-phenotype mapping: genes as computer programs. Trends in Genetics 18(11): 555–559
Păun Gh (2000) Computing with membranes. Journal of Computer and System Sciences 61(1): 108–143, and TUCS Research Report 208, 1998 (http: //www.tucs.fi)
Păun Gh (2002) Membrane Computing: An Introduction. Springer-Verlag, Berlin
Păun Gh (2001) P systems with active membranes: attacking NP complete problems. J Automata, Languages and Combinatorics 6(1): 75–90, and CDMTCS Research report No. 102, 1999, Auckland Univ., New Zeland, www.cs.auckland.ac.nz/CDMTCS
Păun Gh, Rozenberg G and Salomaa A (1998) DNA Computing. New Computing Paradigms. Springer-Verlag, Berlin
Pérez-Jiménez MJ, Romero-Jiménez A and Sancho-Caparrini F (2003) Solving VALIDITY problem by active membranes with input. In: Cavaliere M, Martín-Vide C and Păun Gh (eds) Brainstorming Week on Membrane Computing, Tarragona, 5-11 February 2003. Rovira i Virgili University, Tech. Rep. No. 26
Pérez-Jiménez MJ, Romero-Jiménez A and Sancho-Caparrini F (2003) Complexity classes in cellular computing with membranes. In: Cavaliere M, Martín-Vide C and Păun Gh (eds) Brainstorming Week on Membrane Computing, Tarragona, 5-11 February 2003. Rovira i Virgili University, Tech. Rep. No. 26
Pudlák P (2001) Complexity theory and genetics: the computational power of crossing-over. Information and Computation 171: 201–223
Rozenberg G and Salomaa A (eds) (1997) Handbook of Formal Languages. Springer-Verlag, Berlin
van Emde-Boas P (1985) The second machine class: models of parallelism. In: van Leeuwen J, Lenstra JK and Rinnooy Kan AHG (eds) Parallel Computers and Computations. CWI Syll, Centre for Mathematics and Computer Science, Amstedam
van Leeuwen J and Wiedermann J (1985) Array processing machines. In: Budach L (ed) Fundamentals of Computational Theory 1985, pp. 257–268. Cottbus GDR, Springer-Verlag, LCS 199
Zandron C, Ferretti C and Mauri G (2000) Solving NP-complete problems using P systems with active membranes. In: Antoniou I, Calude CS and Dinneen MJ (eds) Unconventional Models of Computation, pp. 289–301. Springer-Verlag, London
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sosík, P. The computational power of cell division in P systems: Beating down parallel computers?. Natural Computing 2, 287–298 (2003). https://doi.org/10.1023/A:1025401325428
Issue Date:
DOI: https://doi.org/10.1023/A:1025401325428