Skip to main content

Computing Partial Recursive Functions by Virus Machines

  • Conference paper
  • First Online:
Membrane Computing (CMC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9504))

Included in the following conference series:

  • 490 Accesses

Abstract

Virus Machines are a computational paradigm inspired by the manner in which viruses replicate and transmit from one host cell to another. This paradigm provides non-deterministic sequential devices. Non-restricted Virus Machines are unbounded Virus Machines, in the sense that no restriction on the number of hosts, the number of instructions and the number of viruses contained in any host along any computation is placed on them. The computational completeness of these machines has been obtained by simulating register machines. In this paper, Virus Machines as function computing devices are considered. Then, the universality of non-restricted virus machines is proved by showing that they can compute all partial recursive functions.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Chen, X., Valencia-Cabrera, L., Pérez-Jiménez, M.J., Wang, B., Zeng, X.: Computing with viruses. Int. J. Bioinspired Comput. (2015, submitted)

    Google Scholar 

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

    Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: An Introduction to Algorithms. The MIT Press, Cambridge, Massachussets (1994)

    Google Scholar 

  4. Dimmock, N.J., Easton, A.J., Leppard, K.: Introduction to Modern Virology. Blackwell Publishing, Malden (USA) (2007)

    Google Scholar 

  5. Romero-Jiménez, Á., Valencia-Cabrera, L., Pérez-Jiménez, M.J.: Sequential and parallel generation of diophantine sets by virus machines. J. Comput. Theor. Nanosci. (2015, submitted)

    Google Scholar 

  6. Rozenberg, G., Bäck, T., Kok, J.N.: Handbook of Natural Computing, 1st edn. Springer, Heidelberg (2012)

    Google Scholar 

Download references

Acknowledgments

This work was supported by Project TIN2012-37434 of the Ministerio de Economía y Competitividad of Spain, cofinanced by FEDER funds.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Álvaro Romero-Jiménez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Romero-Jiménez, Á., Valencia-Cabrera, L., Riscos-Núñez, A., Pérez-Jiménez, M.J. (2015). Computing Partial Recursive Functions by Virus Machines. In: Rozenberg, G., Salomaa, A., Sempere, J., Zandron, C. (eds) Membrane Computing. CMC 2015. Lecture Notes in Computer Science(), vol 9504. Springer, Cham. https://doi.org/10.1007/978-3-319-28475-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28475-0_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28474-3

  • Online ISBN: 978-3-319-28475-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics