Skip to main content

Computing Partial Recursive Functions by Transition P Systems

  • Conference paper
  • 326 Accesses

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, D.E.: Computability and Logic. Ellis Horwood (1987)

    Google Scholar 

  2. Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  4. Păun, G., Rozenberg, G., Salomaa, A.: Membrane Computing with External Output. Fundamenta Informaticae 41(3), 259–266 (2000)

    MathSciNet  Google Scholar 

  5. Pérez-Jiménez, M.J., Sancho-Caparrini, F.: A Formalization of Transition P Systems. Fundamenta Informaticae 49(1–3), 261–272 (2002)

    MATH  MathSciNet  Google Scholar 

  6. Romero-Jiménez, A.: Complejidad y Universalidad en Modelos de Computación Celular. PhD thesis, Universidad de Sevilla (2003)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  8. Sancho-Caparrini, F.: Verificación de Programas en Modelos de Computación no Convencionales. PhD thesis, Universidad de Sevilla (2002)

    Google Scholar 

  9. The, P Systems Web Page, http://psystems.disco.unimib.it/

  10. Web Page of the Research Group on Natural Computing of University of Sevilla, http://www.cs.us.es/gcn/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Romero-Jiménez, A., Pérez-Jiménez, M.J. (2004). Computing Partial Recursive Functions by Transition P Systems. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24619-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20895-2

  • Online ISBN: 978-3-540-24619-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics