DNA Computing: New Ideas and Paradigms
DNA computing is one of the most exciting new developments in computer science, from both technological and theoretical point of view. We begin by observing how the structure of DNA molecules and the technics available for manipulating them are very suitable for computing. We then establish a link with certain fairly old results from computability theory which essentially explain why the main feature of DNA molecules, the Watson-Crick complementarity, gives rise to the Turing-universality of DNA computations. Selected areas of DNA computing, interesting from a theoretical point of view but offering also practical potential, will be briefly examined.
KeywordsTuring Machine Single Strand Regular Language Massive Parallelism Enumerable Language
Unable to display preview. Download preview PDF.
- 1.L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science 226 1021–1024.Google Scholar
- 3.R.J. Lipton, E.B. Baum, eds., DNA Based Computers, Proc. of the DIMACS Workshop, Princeton, 1995, Amer. Math. Soc., 1996.Google Scholar
- 4.V. Mihalache, A. Salomaa, Language-theoretic aspects of DNA complementarity, Theoret. Comput. Sci., to appear.Google Scholar
- 7.A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, Md., 1981.Google Scholar
- 8.A. Salomaa, Watson-Crick walks and roads in D0L graphs, Acta Cybernetica, to appear.Google Scholar
- 10.B.A. Trakhtenbrot, From logic to theoretical computer science, in C. Calude, ed., People and Ideas in Theoretical Computer Science, Springer-Verlag, Berlin, 1999, 314–341.Google Scholar