Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation

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 conspicuous...

Full description

Bibliographic Details
Main Authors: L. Hartmann, N.D. Jones, J.G. Simonsen, S.B. Vrist
Format: Article
Language:English
Published: Alexandru Ioan Cuza University of Iasi 2011-06-01
Series:Scientific Annals of Computer Science
Online Access:http://www.info.uaic.ro/bin/download/Annals/XXI1/XXI1_9.pdf
id doaj-f1c82c941e7f444198c07a90ec5a33ea
record_format Article
spelling doaj-f1c82c941e7f444198c07a90ec5a33ea2020-11-25T02:44:07ZengAlexandru Ioan Cuza University of IasiScientific Annals of Computer Science1843-81212248-26952011-06-01XXI173106Programming in Biomolecular Computation: Programs, Self-Interpretation and VisualisationL. HartmannN.D. JonesJ.G. SimonsenS.B. VristOur 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.http://www.info.uaic.ro/bin/download/Annals/XXI1/XXI1_9.pdf
collection DOAJ
language English
format Article
sources DOAJ
author L. Hartmann
N.D. Jones
J.G. Simonsen
S.B. Vrist
spellingShingle L. Hartmann
N.D. Jones
J.G. Simonsen
S.B. Vrist
Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation
Scientific Annals of Computer Science
author_facet L. Hartmann
N.D. Jones
J.G. Simonsen
S.B. Vrist
author_sort L. Hartmann
title Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation
title_short Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation
title_full Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation
title_fullStr Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation
title_full_unstemmed Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation
title_sort programming in biomolecular computation: programs, self-interpretation and visualisation
publisher Alexandru Ioan Cuza University of Iasi
series Scientific Annals of Computer Science
issn 1843-8121
2248-2695
publishDate 2011-06-01
description 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.
url http://www.info.uaic.ro/bin/download/Annals/XXI1/XXI1_9.pdf
work_keys_str_mv AT lhartmann programminginbiomolecularcomputationprogramsselfinterpretationandvisualisation
AT ndjones programminginbiomolecularcomputationprogramsselfinterpretationandvisualisation
AT jgsimonsen programminginbiomolecularcomputationprogramsselfinterpretationandvisualisation
AT sbvrist programminginbiomolecularcomputationprogramsselfinterpretationandvisualisation
_version_ 1724767303399112704