%0 Generic
%D 2004
%T Computing Partial Recursive Functions by Transition P Systems
%A Mario J. Pérez-Jiménez
%A Álvaro Romero-Jiménez
%C Amsterdam, The Netherlands
%I Springer
%P 320-340
%R 10.1007/978-3-540-24619-0_23
%U http://dx.doi.org/10.1007/978-3-540-24619-0_23
%V 2933
%X In this paper a variant of transition P systems with external output designed to compute partial functions on natural numbers is presented. These P systems are stable under composition, iteration and unbounded minimization (μ–recursion) of functions. We prove that every partial recursive function can be computed by such P systems, from which the computational completeness of this model can be deduced.
%@ 978-3-540-20895-2