@article {1941,
	title = {Computing with viruses},
	journal = {Theoretical Computer Science},
	volume = {623},
	year = {2016},
	month = {04/2016},
	pages = {146-159},
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {In recent years, different computing models have emerged within the area of Unconventional Computation, and more specifically within Natural Computing, getting inspiration from mechanisms present in Nature. In this work, we incorporate concepts in virology and theoretical computer science to propose a novel computational model, called Virus Machine. Inspired by the manner in which viruses transmit from one host to another, a virus machine is a computational paradigm represented as a heterogeneous network that consists of three subnetworks: virus transmission, instruction transfer, and instruction-channel control networks. Virus machines provide non-deterministic sequential devices. As number computing devices, virus machines are proved to be computationally complete, that is, equivalent in power to Turing machines. Nevertheless, when some limitations are imposed with respect to the number of viruses present in the system, then a characterization for semi-linear sets is obtained.},
	keywords = {Natural computing, register machine, Turing completeness, Virus machine},
	issn = {0304-3975},
	doi = {doi: 10.1016/j.tcs.2015.12.006},
	url = {http://www.sciencedirect.com/science/article/pii/S0304397515011457},
	author = {Xu Chen and Mario J. P{\'e}rez-Jim{\'e}nez and Luis Valencia-Cabrera and Beizhan Wang and XiangXiang Zeng}
}
