Work

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

Year: 2025

Type: article

Abstract: 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 problem in polynomial time using an EXP -uniform family of super virus machines with OR channel parallelism.

Source: Journal of Membrane Computing

DOI: 10.1007/s41965-025-00190-3

Authors: David Orellana-Martín, Claudio Zandron, Alberto Leporati

Institutions: Universidad de Sevilla, University of Milano-Bicocca

Language: English

Topic: DNA and Biological Computing

Subfield: Molecular Biology

Field: Biochemistry, Genetics and Molecular Biology

Domain: Life Sciences

Open Access status: hybrid

Estimated APC paid: $3,290

Funders: Universidad de Sevilla, Dipartimenti di Eccellenza, Università degli Studi di Milano-Bicocca, Major Scientific Project of Zhejiang Laboratory