Proving the Turing universality of oritatami co-transcriptional folding
From MaRDI portal
Publication:5091013
Recommendations
- On the power of oritatami cotranscriptional folding with unary bead sequence
- Simple intrinsic simulation of cellular automata in oritatami molecular folding model
- Transcript design problem of oritatami systems
- Transcript design problem of oritatami systems
- Single-stranded architectures for computing
Cites work
- scientific article; zbMATH DE number 2086632 (Why is no real title available?)
- Know when to fold 'em: self-assembly of shapes by folding in oritatami
- Programming biomolecules that fold greedily during transcription
- Rule set design problems for oritatami systems
- Ruleset optimization on isomorphic oritatami systems
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
- Universality in elementary cellular automata
Cited in
(10)- Counting infinitely by oritatami co-transcriptional folding
- Counting infinitely by oritatami co-transcriptional folding
- On the power of oritatami cotranscriptional folding with unary bead sequence
- Impossibility of strict assembly of infinite fractals by oritatami
- Towards composable computations by RNA co-transcriptional folding: a proof-of-concept demonstration of nested loops in oritatami
- Freezing 1-Tag Systems with States
- Programmable single-stranded architectures for computing
- Transcript design problem of oritatami systems
- Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
- Turning machines
This page was built for publication: Proving the Turing universality of oritatami co-transcriptional folding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091013)
