A thermodynamically favoured Scaffolded DNA Computer (SDC) is demonstrated, grounded in mathematical, physical and computer science principles that explain why the output is thermodynamically favoured, why no error-correction nor precise step-by-step kinetic control are required and how it is programmable and scalable.
Abstract
Like life, computers are out-of-equilibrium.1,2 Thermodynamically favoured error states are thwarted by energetically-costly processes such as kinetic proofreading of biological polymers, error-correcting codes in computer data storage, and redundancy in molecular programming. Decades of theoretical work shows that unlike life thermodynamic computers can operate by drifting naturally to equilibrium.3,4 Similar ideas underlie machine learning models5 and search algorithms such as simulated annealing,6 although executed on non-equilibrium architectures at enormous energy cost.7 Physically implementing thermodynamically favoured computation is a decades-long challenge that could reduce dependence on fuel-consuming error-correction and precise kinetic control. Here, we demonstrate a thermodynamically favoured Scaffolded DNA Computer (SDC) on ten programs including MULTIPLICATION-by-3, Division-by-2, 8-bit Parity-detection, and Addition of up to 25-bit numbers. SDC algorithms have simple experimental protocols, can be reused dozens of times and small instances run in under a minute. The SDC is grounded in mathematical, physical and computer science principles that explain why the output is thermodynamically favoured, why no error-correction nor precise step-by-step kinetic control are required and how it is programmable and scalable. This work creates a new way to think about equilibrium computation in all manner of synthetic systems.
A hierarchical framework for locating energy costs in neural computation while distinguishing three quantities that are frequently cited: process-speci thermodynamic lower bounds, Landauer-normalized reference ratios, and measured or modelled operational energy is developed.
Landauer’s principle establishes a thermodynamic lower bound for physical processes that reduce the logical entropy of information-bearing degrees of freedom, but it does not assign a universal energy cost to every floating-point operation, multiply–accumulate instruction, or transistor transition. This review develops...
Edwar D. Montenegro· Trends in Computer Science a...· 0 citations
Protein-templated synthesis is thus an instance of information-field self-organization in which a fixed rule set in constraint space drives real-space data toward a unique stationary occupation distribution, a principle formally analogous to those previously validated in DNA sequencing by hybridization and RNA inverse...
Kai Huang, Hong-Kui Liu, Zi-Wei Huang· Bio Systems· 0 citations
When any physical system executes a logically irreversible (non-injective) step of a computation, the excess heat released over the Landauer limit is an energetic cost that cannot be recovered. In modern computers this cost vastly dwarfs the Landauer cost. Modern stochastic thermodynamics refers to this cost as the ``e...
Anna A. Condon, David Doty, Niels Kornerup et al.· 0 citations
Z-Hunt-DP is presented, an exact dynamic programming reformulation that preserves the original thermodynamic objective while reducing this search from O(2d) to O(d) for a window of d dinucleotide positions, and solves the same thermodynamic problem by reusing the best partial solutions at each position.
Maysara Al Jumaily, Hamza Qureshi, Hong-Bin Yan et al.· bioRxiv· 0 citations
A full characterisation of a molecular system requires its metastable states, their populations and their intercon-version rates. Molecular Dynamics can in principle provide this characterisation but is limited by sampling and by force-field inaccuracies. Enhanced sampling addresses the first problem, but typically req...
Z. F. Brotzakis, N. Rekatsinas· bioRxiv· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.