WIT Press


Computability Paradigms Based On DNA Complementarity

Price

Free (open access)

Paper DOI

10.2495/IMS970041

Volume

15

Pages

14

Published

1997

Size

1,411 kb

Author(s)

Arto Salomaa

Abstract

The paper discusses the fundamental role of the Watson-Crick complemen- tarity in DNA computing. The close relation of the complementarity to the twin-shuffle language guarantees the universal computing power for any model of DNA computing possessing sufficient input and output facilities. Some such models are also briefly discussed. 1 Introduction Adleman demonstrated, how standard methods of molecular biology could be used to solve a difficult computational problem. Since then the interest on "DNA based computers" has been growing rapidly. There are still con- siderable obstructions to creating a practical molecular computer, and also very pessimistic views have been expressed. Although the real practical feasibility of molecular computers remains still in doubt, the field has opened new vis

Keywords