Simulating 3-symbol Turing machines with SIMD||DNA
David Doty, Aaron Ong
TL;DR
This paper demonstrates how to simulate 3-symbol space-bounded Turing machines using SIMD||DNA, enabling efficient DNA-based computation and providing software tools for simulation and visualization.
Contribution
It introduces a novel method for simulating Turing machines with SIMD||DNA, improving on previous DNA simulation approaches in efficiency and generality.
Findings
Efficient simulation of 3-symbol Turing machines on DNA storage.
Development of software for simulating SIMD||DNA programs.
Generation of SVG visualizations for DNA computation processes.
Abstract
SIMD||DNA is a model of DNA strand displacement allowing parallel in-memory computation on DNA storage. We show how to simulate an arbitrary 3-symbol space-bounded Turing machine with a SIMD||DNA program, giving a more direct and efficient route to general-purpose information manipulation on DNA storage than the Rule 110 simulation of [Wang, Chalk, Soloveichik, DNA 2019]. We also develop software that can simulate SIMD||DNA programs and produce SVG figures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.