On the Computability Power of Membrane Systems with Controlled Mobility

  • Shankara Narayanan Krishna
  • Bogdan Aman
  • Gabriel Ciobanu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7318)

Abstract

In a previous paper we have shown that membrane systems with controlled mobility are able to solve a \(\Pi_2^\mathrm{P}\) complete problem. Then, an enriched model with forced endocytosis and forced exocytosis enables us to move to the fourth level in the polynomial hierarchy, the model having \(\Sigma_4^\mathrm{P} \cup \Pi_4^\mathrm{P}\) as lower bound. In this paper we study the computability power of this model (using forced endocytosis and forced exocytosis), and determine the border condition for achieving computational completeness: 4 membranes provide Turing completeness, while 3 membranes do not. Moreover, we show that the restricted division operation (which is crucial in achieving the \(\Sigma_4^\mathrm{P} \cup \Pi_4^\mathrm{P}\) lower bound) does not provide computational completeness. However, Turing completeness can be achieved with pairs of operations (exocytosis, inhibitive endocytosis) and (inhibitive exocytosis, endocytosis) by using 4 membranes. Finally, we present some computability results expressing that membrane systems which use the operations of restricted division, restricted exocytosis and inhibitive endocytosis cannot yield computational completeness.

Keywords

Turing Machine Membrane System Complete Problem Control Mobility Membrane Computing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aman, B., Ciobanu, G.: Solving a Weak NP-complete Problem in Polynomial Time by Using Mutual Mobile Membrane Systems. Acta Informatica 48(7-8), 409–415 (2011)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Aman, B., Ciobanu, G.: Mobility in Process Calculi and Natural Computing. Springer (2011)Google Scholar
  3. 3.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory (1989)Google Scholar
  4. 4.
    Freund, R., Păun, G.: On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214–225. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Krishna, S.N., Aman, B., Ciobanu, G.: Solving the 4QBF Problem in Polynomial Time by Using the Biological-Inspired Mobility (preprint)Google Scholar
  6. 6.
    Krishna, S.N., Ciobanu, G.: On the Computational Power of Enhanced Mobile Membranes. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 326–335. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Krishna, S.N., Ciobanu, G.: Computability Power of Mobility in Enhanced Mobile Membranes. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 160–170. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  8. 8.
    Krishna, S.N., Ciobanu, G.: A \(\Sigma_2^P \cup \Pi_2^P\) Lower Bound Using Mobile Membranes. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol. 6808, pp. 275–288. Springer, Heidelberg (2011)Google Scholar
  9. 9.
    Krishna, S.N., Păun, G.: P Systems with Mobile Membranes. Natural Computing 4, 255–274 (2005)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)Google Scholar
  11. 11.
    Păun, G.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)MathSciNetMATHGoogle Scholar
  12. 12.
    Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)Google Scholar
  13. 13.
    Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity-Membrane Division, Membrane Creation. In: [12], pp. 302–336Google Scholar
  14. 14.
    Rozenberg, G., Salomaa, A. (eds.): The Mathematical Theory of L Systems. Academic Press (1980)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Shankara Narayanan Krishna
    • 1
  • Bogdan Aman
    • 2
    • 3
  • Gabriel Ciobanu
    • 2
    • 3
  1. 1.Department of Computer Science and EngineeringIIT BombayMumbaiIndia
  2. 2.Institute of Computer ScienceRomanian AcademyIasiRomania
  3. 3.“A. I.Cuza” University of IaşiIasiRomania

Personalised recommendations