A universal time-varying distributed H system of degree 1

Abstract

Time-varying distributed H systems (TVDH systems shortly) of degree n are a well known model of splicing computations which has the following special feature: at different moments one uses different sets of splicing rules (the number of these sets of splicing rules is called the degree of the TVDH system). It is known that there is a universal TVDH system of degree 2. Now we prove that there is a universal TVDH system of degree 1. It is a surprising result because we did not thought that these systems are so powerful. Recently both authors proved that TVDH systems of degree 1 can generate any recursively enumerable languages. We present here the short description of the main idea of the proof that result.