Delay-tolerant oritatami binary counter

DOI10.1016/J.TCS.2026.116021MaRDI QIDQ7266660zbMATH OpenFDO

Authors Yoshihiro Higashinakagawa, Amane Matsuzawa, Shinnosuke Seki

Publication date 15 June 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116021

zbMATH Keywords

counting in binarymultiple transcription speedsoritatamiRNA co-transcriptional folding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Computability and complexity in self-assembly
• Counting infinitely by oritatami co-transcriptional folding
• Design principles for single-stranded RNA origami structures
• On algorithmic self-assembly of squares by co-transcriptional folding
• Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)
• Programming biomolecules that fold greedily during transcription
• Proving the Turing universality of oritatami co-transcriptional folding
• Simple intrinsic simulation of cellular automata in oritatami molecular folding model
• The program-size complexity of self-assembled squares (extended abstract)
• Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
• Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding

This page was built for publication: Delay-tolerant oritatami binary counter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266660)