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.Ministerio de Economía y Competitividad TIN2012- 3743