We prove that every single-tape deterministic Turing machine working in
t(n)
t(n)
time, for some function
t:N→N
t:N→N
, can be simulated by a uniform family of polarizationless P systems with active membranes. Moreover, this is done without significant slowdown in the working time. Furthermore, if
logt(n)
logt(n)
is space constructible, then the members of the uniform family can be constructed by a family machine that uses
O(logt(n))
O(logt(n))
space.Ministerio de Economía y Competitividad TIN2012-3743