Abstract
We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P ≠ NP relation by the polynomial time unsolvability of an NP–complete problem by means of a P system.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science 96, 217–248 (1992)
Cook, S.: The P versus NP problem. Manuscript prepared for the Clay Mathematics Institute for the Millennium Prize Problems (revised November 2000)
Manca, V.: String rewriting and metabolism: A logical perspective. In: Păun, G. (ed.) Computing with Bio-Molecules. Theory and Experiments, pp. 36–60. Springer, Singapore (1998)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); Turku Center for Computer Science-TUCS Report Nr. 208 (1998)
P˘aun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287, 73–100 (2002)
Pérez–Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Teoría de la Complejidad en Modelos de Computación con Membranas. In: Kronos, Sevilla, eds. (2002)
Romero-Jiménez, A.: Complexity and Universality in Cellular Computing Models, PhD. Thesis. University of Seville, Spain (2003)
Romero-Jiménez, A., Pérez Jiménez, M.J.: Simulating Turing machines by P systems with external output. Fundamenta Informaticae 49(1-3), 273–287 (2002)
Turing, A.: On computable numbers with an application to the Entscheidnungsproblem. Proceeding London Mathematical Society, serie 2(42), 230–265 (1936-1937)
Zandron, C., Ferreti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Antoniou, I., Calude, C., Dinneen, M.J. (eds.) Unconventional Models of Computation, UMC 2000, pp. 289–301. Springer, Berlin (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F. (2003). The P Versus NP Problem Through Cellular Computing with Membranes. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24635-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20781-8
Online ISBN: 978-3-540-24635-0
eBook Packages: Springer Book Archive