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

Computing Partial Recursive Functions by Transition P Systems

 

Advanced Search
 
Opened Access Computing Partial Recursive Functions by Transition P Systems
Cites

Show item statistics
Icon
Export to
Author: Romero Jiménez, Álvaro
Pérez Jiménez, Mario de Jesús
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2004
Published in: Membrane Computing : Lecture Notes in Computer Science, vol.2933
ISBN/ISSN: 978-3-540-20895-2
0302-9743
Document type: Chapter of Book
Abstract: 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.
Size: 497.3Kb
Format: PDF

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

DOI: 10.1007/978-3-540-24619-0_23

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)