Capítulo de Libro
Computing Partial Recursive Functions by Transition P Systems
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 | 2004 |
Fecha de depósito | 2016-10-25 |
Publicado en |
|
ISBN/ISSN | 978-3-540-20895-2 0302-9743 |
Resumen | In this paper a variant of transition P systems with external
output designed to compute partial functions on natural numbers is
presented. These P systems are stable under composition, iteration and
unbounded minimization ... In this paper a variant of transition P systems with external output designed to compute partial functions on natural numbers is presented. These P systems are stable under composition, iteration and unbounded minimization (μ–recursion) of functions. We prove that every partial recursive function can be computed by such P systems, from which the computational completeness of this model can be deduced. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España |
Identificador del proyecto | TIC2002-04220-C03-01 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
chp%3A10.1007%2F978-3-540-2461 ... | 497.3Kb | [PDF] | Ver/ | |