Repositorio de producción científica de la Universidad de Sevilla

Generation of Diophantine Sets by Computing P Systems with External Output

Opened Access Generation of Diophantine Sets by Computing P Systems with External Output

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: 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: 2002
Publicado en: Unconventional Models of Computation. Lecture Notes in Computer Science, v.2509
ISBN/ISSN: 978-3-540-44311-7
Tipo de documento: Capítulo de Libro
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 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.
Tamaño: 238.9Kb
Formato: PDF

URI: http://hdl.handle.net/11441/44948

DOI: 10.1007/3-540-45833-6_15

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones