@article {176,
	title = {Computing Partial Recursive Functions by Transition P Systems},
	journal = {Lecture Notes in Computer Science},
	volume = {2933},
	year = {2004},
	pages = {320-340},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	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 (μ{\textendash}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.},
	isbn = {978-3-540-20895-2},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-24619-0_23},
	url = {http://dx.doi.org/10.1007/978-3-540-24619-0_23},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez}
}
