{Networks of Uniform Splicing Processors

TL;DR

This paper introduces a simplified network model of splicing processors called 'networks of uniform splicing processors' that, despite its simplicity, can simulate nondeterministic Turing machines efficiently, demonstrating its computational completeness.

Contribution

The paper presents a new simplified network model of splicing processors that retains computational universality, enabling efficient simulation of Turing machines.

Findings

The new model is computationally complete.

Simulation of Turing machines is time efficient.

Simplifies the structure of splicing processor networks.

Abstract

In this note we consider a new variant of network of splicing processors which simplifies the general model such that filters remain associated with nodes but the input and output filters of every node coincide. This variant is called {\it network of uniform splicing processors}. Although the communication in the new variant seems less powerful, being based on simpler filters, the new variant is sufficiently powerful to be computationally complete. The main result is that nondeterministic Turing machines can be simulated by networks of uniform splicing processors. Furthermore, the simulation is time efficient.