dc.creator | Romero Jiménez, Álvaro | es |
dc.creator | Valencia Cabrera, Luis | es |
dc.creator | Pérez Jiménez, Mario de Jesús | es |
dc.date.accessioned | 2019-03-27T10:24:48Z | |
dc.date.available | 2019-03-27T10:24:48Z | |
dc.date.issued | 2015 | |
dc.identifier.citation | Romero Jiménez, Á., Valencia Cabrera, L. y Pérez Jiménez, M.d.J. (2015). Generating Diophantine Sets by Virus Machines. En BIC-TA 2015: 10th International Conference on Bio-Inspired Computing: Theories and Applications (331-341), Hefei, China: Springer. | |
dc.identifier.isbn | 978-3-662-49013-6 | es |
dc.identifier.issn | 0302-9743 | es |
dc.identifier.uri | https://hdl.handle.net/11441/84791 | |
dc.description.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. | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad TIN2012- 37434 | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | BIC-TA 2015: 10th International Conference on Bio-Inspired Computing: Theories and Applications (2015), p 331-341 | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Virus machines | es |
dc.subject | Computational completeness | es |
dc.subject | Diophantine sets | es |
dc.subject | MRDP theorem | es |
dc.title | Generating Diophantine Sets by Virus Machines | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.relation.projectID | TIN2012- 37434 | es |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-3-662-49014-3_30 | es |
dc.identifier.doi | 10.1007/978-3-662-49014-3_30 | es |
dc.contributor.group | Universidad de Sevilla. TIC193: Computación Natural | es |
idus.format.extent | 11 | es |
dc.publication.initialPage | 331 | es |
dc.publication.endPage | 341 | es |
dc.eventtitle | BIC-TA 2015: 10th International Conference on Bio-Inspired Computing: Theories and Applications | es |
dc.eventinstitution | Hefei, China | es |
dc.relation.publicationplace | Berlin | es |