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...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2025 |
| País: | España |
| Recursos: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/173110 |
| Acesso em linha: | https://hdl.handle.net/11441/173110 https://doi.org/10.1007/s41965-025-00190-3 |
| Access Level: | acceso abierto |
| Palavra-chave: | 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 |
| spelling |
A solution to SAT with virus machines with pre-computed resources Orellana Martín, David Zandron, Claudio Leporati, Alberto Virus machines SAT problem EXP-uniform solution 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. Springer Nature https://hdl.handle.net/11441/173110 https://doi.org/10.1007/s41965-025-00190-3 |
| 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 |
| 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 |
| topic |
Virus machines SAT problem EXP-uniform solution |
| topic_facet |
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 |
| format |
article |
| status_str |
publishedVersion |
| url |
https://hdl.handle.net/11441/173110 https://doi.org/10.1007/s41965-025-00190-3 |
| eu_rights_str_mv |
openAccess |
| publisher |
Springer Nature |
| institution |
Universidad de Sevilla (US) |
| collection |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| reponame_str |
idUS. Depósito de Investigación de la Universidad de Sevilla |
| instname_str |
Universidad de Sevilla (US) |
| _version_ |
1878433175733010433 |
| publishDateSort |
2025 |
| author_browse |
Leporati, Alberto Orellana Martín, David Zandron, Claudio |
| publisherStr |
Springer Nature |
| score |
6,924472 |