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 set generating devices are considered. Then, the universality of non-restricted virus machines is proved by showing that they can compute all diophantine sets, which the MRDP theorem proves that coincide with the recursively enumerable sets.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chen, X., Valencia-Cabrera, L., Pérez-Jiménez, M.J., Wang, B., Zeng X.: Computing with Viruses. International Journal of Bioinspired Computation, submitted, 7(3) 176-182 (Submitted 2015)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: An Introduction to Algorithms. MIT Press, Cambridge (1994)
Dimmock, N.J., Easton, A.J., Leppard, K.: Introduction to Modern Virology, 6th edn. Blackwell Publishing, Malden (2007)
Matijasevich, Y.: Hilbert’s Tenth Problem. MIT Press, Cambridge (1993)
Rozenberg, G., Bäck, T., Kok, J.N.: Handbook of Natural Computing. Springer, Heidelberg (2012)
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Romero-Jiménez, Á., Valencia-Cabrera, L., Pérez-Jiménez, M.J. (2015). Generating Diophantine Sets by Virus Machines. In: Gong, M., Linqiang, P., Tao, S., Tang, K., Zhang, X. (eds) Bio-Inspired Computing -- Theories and Applications. BIC-TA 2015. Communications in Computer and Information Science, vol 562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49014-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-49014-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49013-6
Online ISBN: 978-3-662-49014-3
eBook Packages: Computer ScienceComputer Science (R0)