The oritatami system (OS) is a model of computation by cotranscriptional folding, being inspired by the recent experimental succeess of RNA origami to self-assemble an RNA tile cotranscriptionally.The OSs implemented so far, including binary counter and Turing machine simulator, are deterministic, that is, uniquely fold into one conformation, while nondeterminism is intrinsic in biomolecular folding.We introduce nondeterminism to OS (NOS) and propose an NOS that chooses an assignment of Boolean values nondeterministically and evaluates a logical formula on the assignment.This NOS is seedless in the sense that it does not require any initial conformation to begin with like the RNA origami.The NOS allows to prove the co-NP hardness of deciding, given two NOSs, if there exists no conformation that one of them folds into but the other does not.
|Title of host publication||DNA Computing and Molecular Programming - 22nd International Conference, DNA 2016, Proceedings|
|Editors||Yannick Rondelez, Damien Woods|
|Number of pages||16|
|Publication status||Published - 2016|
|Event||22nd International Conference on Computing and Molecular Programming, DNA 2016 - Munich, Germany|
Duration: 2016 Sep 4 → 2016 Sep 8
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||22nd International Conference on Computing and Molecular Programming, DNA 2016|
|Period||16/9/4 → 16/9/8|
Bibliographical notePublisher Copyright:
© Springer International Publishing Switzerland 2016.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)