%0 Generic
%D 2002
%T Generation of Diophantine Sets by Computing P Systems with External Output
%A Álvaro Romero-Jiménez
%A Mario J. Pérez-Jiménez
%C Amsterdam, The Netherlands
%I Springer
%P 176-190
%R 10.1007/3-540-45833-6_15
%U http://dx.doi.org/10.1007/3-540-45833-6_15
%V 2509
%X 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.
%@ 978-3-540-44311-7