On P systems with active membranes solving the integer factorization problem in a polynomial time

Abstract

There are presented deterministic P systems with active membranes which are able to solve the Integer Factorization Problem in a polynomial time, which is the main result of the paper. There is introduced a class of programs for the description and correct implementation of algorithms of elementary number theory in nonstandard computing systems, especially in P systems with active membranes. By using some of these programs there is achieved the main result. © 2001 Springer-Verlag Berlin Heidelberg.