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: | , , |
|---|---|
| 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 |
| Sumario: | 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. |
|---|