On the power of circular splicing systems and DNA computability

From a biological motivation of the interactions between linear and circular DNA sequences, we propose a new type of splicing model called "circular H systems" and show that they have the same computational power as Turing machines. It is also shown that there effectively exists a universal circular H system which can simulate any circular H system with the same terminal alphabet, which strongly suggests a feasible design for a DNA computer based on circular splicing.