Solving NP-complete Problems in Polynomial Time by Using a Natural Computing Model
- 313 Downloads
The first part of the paper is devoted to a polynomial solution of a well-known NP-complete problem (SAT problem) by using an unconventional computation model provided by P systems with active membranes (with neither polarization nor division rules). An important step of this semi-uniform solution is given by polynomial computing devices to build P systems that contain some exponential-size feature for which solving the SAT problem is easy. NP-complete problems are decision problems that can be solved in polynomial time on a non-deterministic Turing machine. Related to this step, in the second part we show how we can simulate polynomial space Turing machines by using a logarithmic space P system with active membranes, and employing a binary representation in order to encode the positions on the Turing machine tape.
KeywordsNatural computing Membrane computing Turing machines
- 7.Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds.): Applications of Membrane Computing. Springer, New York (2006)Google Scholar
- 14.Păun, G.: Further Twenty Six Open Problems in Membrane Computing. In: Gutiérrez, M.A., et al. (eds.) Third Brainstorming Week on Membrane Computing, pp. 249–262, Fénix Editora, Sevilla (2005)Google Scholar
- 16.Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity-membrane division, membrane creation. In: , pp. 302–336Google Scholar