Contextual insertions/deletions and computability
Information and Computation
Successive State Transitions with I/O Interface by Molecules
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Experimental efficiency of programmed mutagenesis
New Generation Computing
| Hi-index | 0.00 |
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that programmed mutagenesis is theoretically universal by showing how Minsky's 4-symbol 7-state Universal Turing Machine [11] can be implemented using a programmed mutagenesis system. Each step of the Universal Turing Machine is implemented by four cycles of programmed mutagenesis, and progress is guaranteed by the use of alternate sense strands for each rewriting cycle. The full version of the proof will appear in the special issue of TOCS.