Simple intrinsic simulation of cellular automata in oritatami molecular folding model
From MaRDI portal
Publication:2081643
DOI10.1007/978-3-030-61792-9_34OpenAlexW3106992566MaRDI QIDQ2081643
Nicolas Schabanel, Yuki Ubukata, Daria Pchelina, Shinnosuke Seki
Publication date: 13 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-61792-9_34
cellular automataTuring universalityintrinsic universalityco-transcriptional foldingmolecular self-assembly
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (5)
Counting infinitely by oritatami co-transcriptional folding ⋮ Impossibility of strict assembly of infinite fractals by oritatami ⋮ Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami ⋮ Square network on a word ⋮ Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
This page was built for publication: Simple intrinsic simulation of cellular automata in oritatami molecular folding model
