Work

Uniform solution to Subset Sum by means of virus machines

Year: 2025

Type: article

Abstract: Unconventional computing plays an important role in computational complexity theory, providing unconventional computing paradigms to tighten the gap between tractable and presumable intractable problems; however, most unconventional paradigms reach similar gaps and their perspective may become stagnant. In this work, we develop a new outlook by a young natural computing paradigm called virus machines (VMs) which takes inspiration from the biological virus life cycle. A new computational complexity theory through VM is developed by attacking a classical NP-complete problem, the Subset Sum problem. It has been uniformly solved by means of deterministic VM. The uniform construction consists of three different modules: one module B for selecting the possible subset; another module $$Y_j$$ Y j that encodes the selection, adds it or not to the final sum, and compares the result; and one last module END to reach the halting configuration and make the output consistent. This design provides a new perspective for solving presumably hard problems by means of families of VMs, opening new research lines in this framework.

Source: Journal of Membrane Computing

DOI: 10.1007/s41965-025-00201-3

Authors: Antonio Ramírez-de-Arellano, David Orellana-Martín, Francis George C. Cabarle, Mario J. Pérez-Jiménez

Institutions: Romanian Academy, Universidad de Sevilla

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, Major Scientific Project of Zhejiang Laboratory, Consejería de Conocimiento, Investigación y Universidad, Junta de Andalucía, HORIZON EUROPE Marie Sklodowska-Curie Actions