Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)

DOI10.4230/LIPICS.STACS.2022.51MaRDI QIDQ6490997zbMATH OpenFDO

Authors Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.51

zbMATH Keywords

2D Turing machinesarithmetical hierarchy of real numbersco-transcriptional foldingcomputabilityintrinsic simulationmolecular self-assembly

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(3)

• Freezing 1-Tag Systems with States
• Programmable single-stranded architectures for computing
• Delay-tolerant oritatami binary counter

This page was built for publication: Oritatami systems assemble shapes No less complex than tile assembly model (ATAM)

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