Abstract
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.
This work is supported in part by KAKENHI Grant-in-Aid for Challenging Research (Exploratory) No. 18K19779 and JST Program to Disseminate Tenure Tracking System No. 6F36, both granted to S. S.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
Bryans, N., Chiniforooshan, E., Doty, D., Kari, L., Seki, S.: The power of nondeterminism in self-assembly. Theory Comput. 9, 1–29 (2013)
Evans, C.G.: Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. Ph.D. thesis, Caltech (2014)
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)
Geary, C., Étienne Meunier, P., Schabanel, N., Seki, S.: Oritatami: a computational model for molecular co-transcriptional folding. Int. J. Mol. Sci. 20(9), 2259 (2019)
Geary, C., Rothemund, P.W.K., Andersen, E.S.: A single-stranded architecture for cotranscriptional folding of RNA nanostructures. Science 345(6198), 799–804 (2014)
Masuda, Y., Seki, S., Ubukata, Y.: Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding. In: Câmpeanu, C. (ed.) CIAA 2018. LNCS, vol. 10977, pp. 261–273. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94812-6_22
McClung, C.R.: Plant circadian rhythms. Plant Cell 18, 792–803 (2006)
Minsky, M. (ed.): Computation: Finite and Infinite Machines. Prentice-Hall Inc., Upper Saddle River (1967)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Maruyama, K., Seki, S. (2020). Counting Infinitely by Oritatami Co-transcriptional Folding. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-030-38919-2_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38918-5
Online ISBN: 978-3-030-38919-2
eBook Packages: Computer ScienceComputer Science (R0)