Counting Infinitely by Oritatami Co-transcriptional Folding
A fixed bit-width counter was proposed as a proof-of-concept demonstration of an oritatami model of cotranscriptional folding [Geary et al., Proc. MFCS 2016, LIPIcs 58, 43:1–43:14], and it was embedded into another oritatami system that self-assembles a finite portion of Heighway dragon fractal. In order to expand its applications, we endow this counter with capability to widen bit-width at every encounter with overflow.
- 1.Adleman, L., Chang, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proceedings of the STOC 2001, pp. 740–748. ACM (2001)Google Scholar
- 3.Evans, C.G.: Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. Ph.D. thesis, Caltech (2014)Google Scholar
- 4.Geary, C., Étienne Meunier, P., Schabanel, N., Seki, S.: Proving the turing universality of oritatami co-transcriptional folding. In: Proceedings of the ISAAC 2018, pp. 23:1–23:13 (2018)Google Scholar
- 10.Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the STOC 2000, pp. 459–468. ACM (2000)Google Scholar