Capítulo de Libro
Generation of Diophantine Sets by Computing P Systems with External Output
Autor/es | Romero Jiménez, Álvaro
Pérez Jiménez, Mario de Jesús |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2002 |
Fecha de depósito | 2016-09-13 |
Publicado en |
|
ISBN/ISSN | 978-3-540-44311-7 0302-9743 |
Resumen | 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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
gdscpseo.pdf | 238.9Kb | [PDF] | Ver/ | |