Simulation of a Turing Machine using EndoII Splicing Rules
نویسندگان
چکیده
In this paper we define splicing rules for class II restriction endonucleases and show how a Turing Machine can be simulated using such rules.
منابع مشابه
DNA Computing Based on Splicing : Universality
The paper extends some of the most recently obtained results on the computational universality of speciic variants of H systems (e. g. with regular sets of rules) and proves that we can construct universal computers based on various types of H systems with a nite set of splicing rules as well as a nite set of axioms, i. e. we show the theoretical possibility to design programmable universal DNA...
متن کاملSimulating Turing Machines through Extended Mh Systems
In this article we describe a method of translation from a deterministic Turing machine to an extended mH splicing system. The accuracy of this translation is proved by a theorem which shows that the only string present in single copy is a coding of a connguration of the simulated Turing machine. A simpler translation from a universal Turing machine with three tapes to an extended mH system is ...
متن کاملDNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of specific variants of H systems (e.g. with regular sets of rules) and proves that we can construct universal computers based on various types of H systems with a finite set of splicing rules as well as a finite set of axioms, i.e. we show the theoretical possibility to design programmable universal ...
متن کاملDNA Computing Based on Splicing: Universality Results.dvi
The paper extends some of the most recently obtained results on the computational universality of extended H systems (with regular sets of rules respectively with finite sets of rules used with simple additional mechanisms) and shows the possibility to obtain universal systems based on these extended H systems, i. e. the theoretical possibility to design programmable universal DNA computers bas...
متن کاملRemarks on the universality of splicing systems
In this paper, we look at extended H systems in order to find how small such a system can be in order to generate a recursively enumerable language. 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 2×|I|+2 rules in order to define an extended H system H which generates L, where...
متن کامل