A connection between red-green turing machines and watson-crick T0l systems

Abstract

Motivated by the conceptual similarity of a mind change of a red-green Turing machine and of a turn to the complementary word in Watson-Crick L systems as well as by the fact that both red-green Turing machines and Watson-Crick L systems define infinite runs, we establish a connection between the two areas of unconventional computing.We show that the sets of numbers which can be recognized by so-called standard Watson-Crick T0L systems coincide with those recognized by red-green register machines (or red-green Turing machines). The results imply that usingWatson-Crick L systemswe may “go beyondTuring” in a similarway as red-green register machines and red-green Turing machines can do.