Generation of Diophantine Sets by Computing P Systems with External Output

Romero Jiménez, ÁlvaroPérez Jiménez, Mario de Jesús2016-09-132016-09-132002978-3-540-44311-70302-9743http://hdl.handle.net/11441/44948In 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Generation of Diophantine Sets by Computing P Systems with External Outputinfo:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/3-540-45833-6_15