A solution to SAT with virus machines with pre-computed resources

In Natural Computing, different real-life processes can appear as the inspiration for a new model of computation. Virus machines use the spread and replication of biological viruses as an inspiration for a model of computation with three well differentiated graphs: the hosts graph, that acts like th...

Descripción completa

Detalles Bibliográficos
Autores: Orellana Martín, David, Zandron, Claudio, Leporati, Alberto
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2025
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/173110
Acceso en línea:https://hdl.handle.net/11441/173110
https://doi.org/10.1007/s41965-025-00190-3
Access Level:acceso abierto
Palabra clave:Virus machines
SAT problem
EXP-uniform solution
id ES_32d8dbcf6a170ce8d3da7d0798a2575e
oai_identifier_str oai:idus.us.es:11441/173110
network_acronym_str ES
network_name_str España
repository_id_str
spelling A solution to SAT with virus machines with pre-computed resourcesOrellana Martín, DavidZandron, ClaudioLeporati, AlbertoVirus machinesSAT problemEXP-uniform solutionIn Natural Computing, different real-life processes can appear as the inspiration for a new model of computation. Virus machines use the spread and replication of biological viruses as an inspiration for a model of computation with three well differentiated graphs: the hosts graph, that acts like the memory; the instructions graph, that acts as a program; and the instructions-channel graph, that controls the flow of information through the system. In previous works, the computational power and problem-solving capabilities of this model have been demonstrated. In this work, we provide an application for solving the SAT problem in polynomial time using an EXP-uniform family of super virus machines with OR channel parallelism.Springer NatureCiencias de la Computación e Inteligencia Artificial2025info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/173110https://doi.org/10.1007/s41965-025-00190-3reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésJournal of Membrane Computing, 114077.https://link.springer.com/article/10.1007/s41965-025-00190-3info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1731102026-06-17T12:51:07Z
dc.title.none.fl_str_mv A solution to SAT with virus machines with pre-computed resources
title A solution to SAT with virus machines with pre-computed resources
spellingShingle A solution to SAT with virus machines with pre-computed resources
Orellana Martín, David
Virus machines
SAT problem
EXP-uniform solution
title_short A solution to SAT with virus machines with pre-computed resources
title_full A solution to SAT with virus machines with pre-computed resources
title_fullStr A solution to SAT with virus machines with pre-computed resources
title_full_unstemmed A solution to SAT with virus machines with pre-computed resources
title_sort A solution to SAT with virus machines with pre-computed resources
dc.creator.none.fl_str_mv Orellana Martín, David
Zandron, Claudio
Leporati, Alberto
author Orellana Martín, David
author_facet Orellana Martín, David
Zandron, Claudio
Leporati, Alberto
author_role author
author2 Zandron, Claudio
Leporati, Alberto
author2_role author
author
dc.contributor.none.fl_str_mv Ciencias de la Computación e Inteligencia Artificial
dc.subject.none.fl_str_mv Virus machines
SAT problem
EXP-uniform solution
topic Virus machines
SAT problem
EXP-uniform solution
description In Natural Computing, different real-life processes can appear as the inspiration for a new model of computation. Virus machines use the spread and replication of biological viruses as an inspiration for a model of computation with three well differentiated graphs: the hosts graph, that acts like the memory; the instructions graph, that acts as a program; and the instructions-channel graph, that controls the flow of information through the system. In previous works, the computational power and problem-solving capabilities of this model have been demonstrated. In this work, we provide an application for solving the SAT problem in polynomial time using an EXP-uniform family of super virus machines with OR channel parallelism.
publishDate 2025
dc.date.none.fl_str_mv 2025
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/173110
https://doi.org/10.1007/s41965-025-00190-3
url https://hdl.handle.net/11441/173110
https://doi.org/10.1007/s41965-025-00190-3
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Journal of Membrane Computing, 114077.
https://link.springer.com/article/10.1007/s41965-025-00190-3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer Nature
publisher.none.fl_str_mv Springer Nature
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405700897112064
score 15,81155

Similares en LA Referencia