DMCA
Efficient Turing-universal computation with DNA polymers (extended abstract)
| Citations: | 20 - 4 self |
BibTeX
@MISC{Qian_efficientturing-universal,
author = {Lulu Qian and David Soloveichik and Erik Winfree},
title = {Efficient Turing-universal computation with DNA polymers (extended abstract)},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Bennett’s proposed chemical Turing machine is one of the most important thought experiments in the study of the thermodynamics of computation. Yet the sophistication of molecular engineering required to physically construct Bennett’s hypothetical polymer substrate and enzyme has deterred experimental implementations. Here we propose a chemical implementation of stack machines — a Turing-universal model of computation similar to Turing machines — using strand displacement cascades as the underlying chemical primitive. More specifically, the mechanism described herein is the addition and removal of monomers from the end of a polymer, controlled by strand displacement logic. We capture the motivating feature of Bennett’s scheme — that physical reversibility corresponds to logically reversible computation, and arbitrarily little energy per computation step is required. Further, as a method of embedding logic control into chemical and biological systems, polymer-based chemical computation is significantly more efficient than geometry-free chemical reaction networks. 1
Keyphrases
efficient turing-universal computation dna polymer motivating feature chemical primitive turing machine chemical turing machine turing-universal model little energy strand displacement logic biological system physical reversibility stack machine molecular engineering reversible computation polymer-based chemical computation bennett hypothetical polymer substrate logic control important thought experiment experimental implementation computation step bennett scheme strand displacement cascade chemical implementation geometry-free chemical reaction network
