Generation of Diophantine Sets by Computing P Systems with External Output

Fri, 11/30/2007 - 13:21 — ana

Title	Generation of Diophantine Sets by Computing P Systems with External Output
Publication Type	Journal Papers
Year of Publication	2002
Authors	Romero-Jiménez, Á., & Pérez-Jiménez M. J.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-44311-7
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	2509
Pages	176-190
Abstract	In this paper a variant of P systems with external output designed to compute functions on natural numbers is presented. These P systems are stable under composition and iteration of functions. We prove that every diophantine set can be generated by such P systems; then, the universality of this model can be deduced from the theorem by Matiyasevich, Robinson, Davis and Putnam in which they establish that every recursively enumerable set is a diophantine set.
URL	http://dx.doi.org/10.1007/3-540-45833-6_15
ISSN Number	0302-9743
DOI	10.1007/3-540-45833-6_15

Research Group on Natural Computing