Oritatami Folding Turing: Simulating Universal Computation 🧬

This is the movie of a theoretical molecular model folding co-transcriptionnally so that to simulate any skipping cyclic tag system and thus ables of any Turing computation with only a polynomial time slowdown <br /> <br />The skipping cyclic tag system simulated: <br />Init word: 10 <br />Current Production [ 0] 100 <br />NewWord: 01 <br />Current Production [ 2] 0 <br />NewWord: 1 <br />Current Production [ 3] <br />NewWord: 100 <br />Current Production [ 1] 1 <br />NewWord: 000 <br />Current Production [ 3] <br />NewWord: 00 <br />Current Production [ 0] 100 <br />NewWord: 0 <br />Current Production [ 1] 1 <br />NewWord: <br />Current Production [ 2] 0 <br />Computation terminated