Computing Partial Recursive Functions by Transition P Systems

Fri, 11/30/2007 - 11:14 — ana

Title	Computing Partial Recursive Functions by Transition P Systems
Publication Type	Journal Papers
Year of Publication	2004
Authors	Pérez-Jiménez, M. J., & Romero-Jiménez Á.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-20895-2
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	2933
Pages	320-340
Abstract	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.
URL	http://dx.doi.org/10.1007/978-3-540-24619-0_23
ISSN Number	0302-9743
DOI	10.1007/978-3-540-24619-0_23

Research Group on Natural Computing