An RNA-based theory of natural universal computation
From MaRDI portal
Publication:2670144
DOI10.1016/j.jtbi.2021.110984zbMath1483.92063arXiv2008.08814OpenAlexW4205665557MaRDI QIDQ2670144
Publication date: 10 March 2022
Published in: Journal of Theoretical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.08814
universal computationlambda calculusRNAcombinatory logicsecondary structureChurch-Turing thesisjunk DNAmolecular engramTuring-completenessTuring-equivalence
Biochemistry, molecular biology (92C40) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation
- Strand algebras for DNA computing
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Computation with finite stochastic chemical reaction networks
- Turing computability with neural nets
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Computability with low-dimensional dynamical systems
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Implementation of Turing machine using DNA strand displacement
- \(\lambda\)-definability and recursiveness
- Efficient Turing-Universal Computation with DNA Polymers
- Modelling, Simulating and Verifying Turing-Powerful Strand Displacement Systems
- Comparing Computational Power
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Chemical implementation of neural networks and Turing machines.
- Unpredictability and undecidability in dynamical systems
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
- The Church-Turing Thesis over Arbitrary Domains
- Logical Reversibility of Computation
- New Computational Paradigms
- New Computational Paradigms
- On Computable Numbers, with an Application to the Entscheidungsproblem
- The þ-function in λ-K-conversion
This page was built for publication: An RNA-based theory of natural universal computation