Scholarlink

<p>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 <i>hosts</i> graph, that acts like the memory; the <i>instructions</i> graph, that acts as a program; and the <i>instructions-channel</i> 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 <Emphasis FontCategory="SansSerif">SAT</Emphasis> problem in polynomial time using an <b>EXP</b>-uniform family of super virus machines with OR channel parallelism.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年5月7日

查看全文
  • David Orellana-Martín,
  • Claudio Zandron,
  • Alberto Leporati

摘要

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.