Advertisement

Computing Partial Recursive Functions by Transition P Systems

  • Alvaro Romero-Jiménez
  • Mario J. Pérez-Jiménez
Conference paper
  • 285 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)

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.

Keywords

Membrane Structure Partial Function Evolution Rule Informal Manner Original Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cohen, D.E.: Computability and Logic. Ellis Horwood (1987)Google Scholar
  2. 2.
    Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  4. 4.
    Păun, G., Rozenberg, G., Salomaa, A.: Membrane Computing with External Output. Fundamenta Informaticae 41(3), 259–266 (2000)MathSciNetGoogle Scholar
  5. 5.
    Pérez-Jiménez, M.J., Sancho-Caparrini, F.: A Formalization of Transition P Systems. Fundamenta Informaticae 49(1–3), 261–272 (2002)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Romero-Jiménez, A.: Complejidad y Universalidad en Modelos de Computación Celular. PhD thesis, Universidad de Sevilla (2003)Google Scholar
  7. 7.
    Romero-Jiménez, A., Pérez-Jiménez, M.J.: Generation of Diophantine Sets by Computing P Systems with External Output. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 176–190. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Sancho-Caparrini, F.: Verificación de Programas en Modelos de Computación no Convencionales. PhD thesis, Universidad de Sevilla (2002)Google Scholar
  9. 9.
    The, P Systems Web Page, http://psystems.disco.unimib.it/
  10. 10.
    Web Page of the Research Group on Natural Computing of University of Sevilla, http://www.cs.us.es/gcn/

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alvaro Romero-Jiménez
    • 1
  • Mario J. Pérez-Jiménez
    • 1
  1. 1.Dpto. de Ciencias de la Computación e Inteligencia ArtificialUniversidad de SevillaSpain

Personalised recommendations