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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Cavaliere, M., Jonoska, N., Yogev, S., Piran, R., Keinan, E., & Seeman, N. C. (2005). Biomolecular implementation of computing devices with unbounded memory. In Lecture Notes in Computer Science (Vol. 3384, pp. 35–49). Springer Verlag. https://doi.org/10.1007/11493785_4
Mendeley helps you to discover research relevant for your work.