Computing Threshold Circuits with Void Reactions in Step Chemical Reaction Networks (2402.08220v1)
Abstract: We introduce a new model of \emph{step} Chemical Reaction Networks (step CRNs), motivated by the step-wise addition of materials in standard lab procedures. Step CRNs have ordered reactants that transform into products via reaction rules over a series of steps. We study an important subset of weak reaction rules, \emph{void} rules, in which chemical species may only be deleted but never changed. We demonstrate the capabilities of these simple limited systems to simulate threshold circuits and compute functions using various configurations of rule sizes and step constructions, and prove that without steps, void rules are incapable of these computations, which further motivates the step model. Additionally, we prove the coNP-completeness of verifying if a given step CRN computes a function, holding even for $O(1)$ step systems.
- Reachability in restricted chemical reaction networks, 2022. arXiv:2211.12603.
- Computation in networks of passively mobile finite-state sensors. Distribed Computing, 18(4):235–253, mar 2006. doi:10.1007/s00446-005-0138-3.
- A simple population protocol for fast robust approximate majority. Distributed Computing, 21:87–102, 2008.
- The computational power of population protocols. Distributed Computing, 2007.
- Rutherford Aris. Prolegomena to the rational analysis of systems of chemical reactions. Archive for Rational Mechanics and Analysis, 19(2):81–99, jan 1965. doi:10.1007/BF00282276.
- Rutherford Aris. Prolegomena to the rational analysis of systems of chemical reactions ii. some addenda. Archive for Rational Mechanics and Analysis, 27(5):356–364, jan 1968. doi:10.1007/BF00251438.
- Computational functions in biochemical reaction networks. Biophysical journal, 67(2):560–578, 1994.
- Ari. Aviram. Molecules for memory, logic, and amplification. Journal of the American Chemical Society, 110(17):5687–5692, Aug 1988. doi:10.1021/ja00225a017.
- A general-purpose crn-to-dsd compiler with formal verification, optimization, and simulation capabilities. In International conference on DNA-based computers, pages 232–248. Springer, 2017.
- Real parallel and constant delay logic circuit design methodology based on the dna model-of-computation. Microprocessors and Microsystems, 61:217–226, 2018.
- The cell cycle switch computes approximate majority. Scientific reports, 2(1):656, 2012.
- Chemical reaction network designs for asynchronous logic circuits. Natural computing, 17:109–130, 2018.
- From electric circuits to chemical networks. Natural Computing, 19:237–248, 2020.
- Optimal staged self-assembly of general shapes. Algorithmica, 80:1383–1409, 2018.
- Deterministic function computation with chemical reaction networks. Natural computing, 13(4):517–534, 2014.
- Simulation of multiple stages in single bin active tile self-assembly. In International Conference on Unconventional Computation and Natural Computation, pages 155–170. Springer, 2023.
- Programmability of Chemical Reaction Networks, pages 543–584. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009. doi:10.1007/978-3-540-88869-7_27.
- Probabilistic analysis of localized dna hybridization circuits. ACS synthetic biology, 4(8):898–913, 2015.
- One-dimensional staged self-assembly. Natural Computing, 12(2):247–258, 2013.
- Robust chemical circuits. Biosystems, 186:103983, 2019.
- An odd parity checker prototype using dnazyme finite state machine. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 11(2):316–324, 2013.
- A simple, label-free, electrochemical dna parity generator/checker for error detection during data transmission based on “aptamer-nanoclaw”-modulated protein steric hindrance. Chemical Science, 9(34):6981–6987, 2018. doi:10.1039/C8SC02482K.
- Engineering dna logic systems with non-canonical dna-nanostructures: Basic principles, recent developments and bio-applications. Science China Chemistry, 65(2):284–297, 2022.
- Chemical implementation of neural networks and turing machines. Proceedings of the National Academy of Sciences, 88(24):10983–10987, 1991.
- Digital logic with molecular reactions. In 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 721–727. IEEE, 2013.
- Parallel program schemata. Journal of Computer and System Sciences, 3(2):147–195, 1969. doi:https://doi.org/10.1016/S0022-0000(69)80011-5.
- Design and analysis of dna strand displacement devices using probabilistic model checking. Journal of the Royal Society Interface, 9(72):1470–1485, 2012.
- Mining biochemical circuits from enzyme databases via boolean reasoning. In Proceedings of the 39th International Conference on Computer-Aided Design, pages 1–9, 2020.
- David C Magri. A fluorescent and logic gate driven by electrons and protons. New Journal of Chemistry, 33(3):457–461, 2009.
- Majority and minority gates realized in enzyme-biocatalyzed systems integrated with logic networks and interfaced with bioelectronic systems. The Journal of Physical Chemistry B, 118(24):6775–6784, Jun 2014. doi:10.1021/jp504057u.
- Iterative self-assembly with dynamic strength transformation and temperature control. In DNA Computing and Molecular Programming: 19th International Conference, DNA 19, Tempe, AZ, USA, September 22-27, 2013. Proceedings 19, pages 147–159. Springer, 2013.
- Carl Adam Petri. Kommunikation mit Automaten. PhD thesis, Rheinisch-Westfälischen Institutes für Instrumentelle Mathematik an der Universität Bonn, 1962.
- Scaling up digital circuit computation with dna strand displacement cascades. science, 332(6034):1196–1201, 2011.
- A simple dna gate motif for synthesizing large-scale circuits. Journal of The Royal Society Interface, 8(62):1281–1297, Feb 2011. doi:10.1098/rsif.2010.0729.
- Igor Sergeevich Sergeev. Upper bounds for the formula size of symmetric boolean functions. Russian Mathematics, 58:30–42, 2014.
- Computation with finite stochastic chemical reaction networks. natural computing, 7(4):615–633, 2008.
- Dna as a universal substrate for chemical kinetics. Proceedings of the National Academy of Sciences, 107(12):5393–5398, 2010.
- Space and energy efficient computation with dna strand displacement systems. In International Workshop on DNA-Based Computers, 2012.
- Leakless dna strand displacement systems. In DNA Computing and Molecular Programming: 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings 21, pages 133–153. Springer, 2015.
- Compiler-aided systematic construction of large-scale dna strand displacement circuits using unpurified components. Nature Communications, 8(1):1–12, 2017.
- Craig A Tovey. A simplified np-complete satisfiability problem. Discrete applied mathematics, 8(1):85–89, 1984.
- Crn++: Molecular programming language. Natural Computing, 19:391–407, 2020.
- Effective design principles for leakless strand displacement systems. Proceedings of the National Academy of Sciences, 115(52):E12182–E12191, 2018.
- Erik Winfree. Chemical reaction networks and stochastic local search. In DNA Computing and Molecular Programming: 25th International Conference, DNA 25, Seattle, WA, USA, August 5–9, 2019, Proceedings 25, pages 1–20. Springer, 2019.
- Molecular full adder based on dna strand displacement. IEEE Access, 8:189796–189801, 2020. doi:10.1109/ACCESS.2020.3031221.
- Dynamic dna nanotechnology using strand-displacement reactions. Nature chemistry, 3(2):103–113, 2011.