Programming in biomolecular computation: programs, self-interpretation and visualisation

Lars Røeboe Hartmann, Neil Jones, Jakob Grue Simonsen, Søren Bjerregaard Vrist

4 Citations (Scopus)

Abstract

Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems notable by its absence: Where are the programs? We identify a number of common features in programming that seem conspicuously absent from the literature on biomolecular computing; to partially redress this absence, we introduce a model of computation that is evidently programmable, by programs reminiscent of low-level computer machine code; and at the same time biologically plausible: its functioning is defined by a single and relatively small set of chemical-like reaction rules. Further properties: the model is stored-program: programs are the same as data, so programs are not only executable, but are also compilable and interpretable. It is universal: all computable functions can be computed (in natural ways and without arcane encodings of data and algorithm); it is also uniform: new ``hardware'' is not needed to solve new problems; and (last but not least) it is Turing complete in a strong sense: a universal algorithm exists, that is able to execute any program, and is not asymptotically inefficient.
Original languageEnglish
JournalScientific Annals of Computer Science
Volume21
Issue number1
Pages (from-to)73-106
Number of pages34
ISSN1843-8121
Publication statusPublished - 2011

Cite this