Computing by Observing Bio-Systems: the Case of Sticker Systems (bibtex)
by Alhazov, Artiom and Cavaliere, Matteo
Abstract:
A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by this, a new approach to computing, called system/observer, was introduced in [3]. In this paper we apply this strategy to sticker systems, [8, 11]. In particular we use finite automata (playing the role of observer) watching the “evolution� of a sticker system and translating such “evolution� into a readable output. We show that this way of “computing by observing� brings us results quite different from the ones obtained when considering sticker systems in the standard manner. Even regular simple sticker systems (whose generative power is subregular) become universal when considered in this new framework. The significance of these results for DNA computing (by sticker systems) is briefly discussed.
Reference:
Computing by Observing Bio-Systems: the Case of Sticker Systems (Alhazov, Artiom and Cavaliere, Matteo), In DNA Computing: 10th International Workshop on DNA Computing, DNA10, Milan, Italy, Revised Selected Papers (C. Ferretti, G. Mauri, C. Zandron, ed.), Springer, volume 3384, 2005.
Bibtex Entry:
@InProceedings{inp110,
  author    = {Alhazov, Artiom AND Cavaliere, Matteo},
  title     = {Computing by Observing Bio-Systems: the Case of Sticker Systems},
  booktitle = {DNA Computing: 10th International Workshop on DNA Computing, DNA10, Milan, Italy, Revised Selected Papers},
  year      = {2005},
  editor    = {C. Ferretti, G. Mauri, C. Zandron},
  volume    = {3384},
  series    = {Lecture Notes in Computer Science},
  pages     = {1-13},
  publisher = {Springer},
  abstract  = {A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by this, a new approach to computing, called system/observer, was introduced in [3]. In this paper we apply this strategy to sticker systems, [8, 11]. In particular we use finite automata (playing the role of observer) watching the “evolution� of a sticker system and translating such “evolution� into a readable output. We show that this way of “computing by observing� brings us results quite different from the ones obtained when considering sticker systems in the standard manner. Even regular simple sticker systems (whose generative power is subregular) become universal when considered in this new framework. The significance of these results for DNA computing (by sticker systems) is briefly discussed.},
  keywords  = {Evolution, Observation, Sticker Systems, Computability},
  pdf       = {pdfs/AC2005a.pdf},
}
Powered by bibtexbrowser