2016-10-252016-10-252004978-3-540-20895-20302-9743http://hdl.handle.net/11441/48084In 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccess10.1007/978-3-540-24619-0_23https://idus.us.es/xmlui/handle/11441/48084