Biomolecular implementation of computing devices with unbounded memory

Matteo Cavaliere, Nataša Jonoska, Sivan Yogev, Ron Piran, Ehud Keinan, Nadrian C. Seeman

Research output: Contribution to journalConference articlepeer-review

Abstract

We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down automata, using circular DNA molecules and a class IIs restriction enzyme. The proposed ideas are inspired by the results from [1]. The same ideas are extended to show a way to implement push-down automata with two stacks (i.e, universal computing devices) using two circular molecules glued with a DX molecule and a class IIs restriction enzyme. In this case each computational molecule also contains a DX portion. These devices can potentially be incorporated in an array of TX molecules.

Original languageEnglish (US)
Pages (from-to)35-49
Number of pages15
JournalLecture Notes in Computer Science
Volume3384
DOIs
StatePublished - 2005
Event10th International Workshop on DNA Computing, DNA 10 - Milan, Italy
Duration: Jun 7 2004Jun 10 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Biomolecular implementation of computing devices with unbounded memory'. Together they form a unique fingerprint.

Cite this