Splicing systems for universal turing machines



: Harju T, Margenstern M

: 2005

Lecture Notes in Computer Science

DNA COMPUTING

: LECT NOTES COMPUT SC

: 3384

: 149

: 158

: 10

: 3-540-26174-5

: 0302-9743


It turns out that starting from a Turing machine M with alphabet A and finite set of states Q which generates a given recursively enumerable language L, we need around 2x/I/+2 rules in order to define an extended H system H which generates L, where I is the set of instructions of Turing machine M. Next, coding the states of Q and the non-terminal symbols of,C, we obtain, an extended H system H-1 which generates L using /A/+2 symbols. At last, by encoding the alphabet, we obtain a splicing system U which generates a universal recursively enumerable set using only two letters.



Last updated on 2025-14-10 at 09:53