Real-time computability of real numbers by chemical reaction networks

@article{Huang2018RealtimeCO,
  title={Real-time computability of real numbers by chemical reaction networks},
  author={Xiang Huang and Titus H. Klinge and James I. Lathrop and Xiaoyuan Li and Jack H. Lutz},
  journal={Natural Computing},
  year={2018},
  volume={18},
  pages={63-73}
}
We explore the class of real numbers that are computed in real time by deterministic chemical reaction networks that are integral in the sense that all their reaction rate constants are positive integers. We say that such a reaction network computes a real number $$\alpha$$α in real time if it has a designated species X such that, when all species concentrations are set to zero at time $$t = 0$$t=0, the concentration x(t) of X is within $$2^{-t}$$2-t of $$|\alpha |$$|α| at all times $$t \ge 1… 
2 Citations
Robust Real-time Computing with Chemical Reaction Networks
TLDR
This paper solves the open problem of the inclusion of the real algebraic numbers RLCRN and RRTCRN and arrives at a discrete model of memory that can tolerate small perturbations of its species’ concentrations.
Computing Real Numbers with Large-Population Protocols Having a Continuum of Equilibria
Bournez, Fraigniaud, and Koegler [6] defined a number in [0,1] as computable by their Large-Population Protocol (LPP) model, if the proportion of agents in a set of marked states converges to said
A Survey on Analog Models of Computation
TLDR
A survey on analog models of computations, which considers both approaches, often intertwined, with a point of view mostly oriented by computation theory.
Robust Real-time Computing with Chemical Reaction Networks
TLDR
This paper solves the open problem of the inclusion of the real algebraic numbers RLCRN and RRTCRN and arrives at a discrete model of memory that can tolerate small perturbations of its species’ concentrations.
Real-Time Equivalence of Chemical Reaction Networks and Analog Computers
TLDR
A similar class of real numbers that are computable in real time by general purpose analog computers is defined, and it is proved that a CRN with integer initial concentrations can be simulated by aCRN with all zero initial concentrations.

References

SHOWING 1-10 OF 87 REFERENCES
Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
TLDR
The strong (uniform computability) Turing completeness of chemical reaction networks over a finite set of molecular species under the differential semantics is derived, solving a long standing open problem.
Programmability of Chemical Reaction Networks
TLDR
This work surveys known connections and gives new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri Nets, Gate Implementability, Primitive Recursive Functions, Register Machines, Fractran, and Turing Machines.
CHEMICAL KINETICS IS TURING UNIVERSAL
Interest in chemical computation has followed four different paths. It is one of the natural extensions of discussions about information and thermodynamics, which go back to Maxwell demon arguments
Nearly Linear Time
TLDR
This work introduces a class NLT of functions computable in nearly linear time n(log n)O(1) on random access computers and gives also a machine-independent definition of NLT and a natural problem complete for NLT.
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
TLDR
This result provides arguments in favour of a generalised form of the Church-Turing Hypothesis, which states that any physically realistic (macroscopic) computer is equivalent to Turing machines both in terms of computability and complexity.
Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers)
TLDR
This work presents a mathematical definition of an analog generable function of a real variable in terms of a simultaneous set of nonlinear differential equations possessing a "domain of generation," which includes functions generated by existing general-purpose analog computers.
Complexity Theory of Real Functions
  • K. Ko
  • Computer Science, Mathematics
    Progress in Theoretical Computer Science
  • 1991
TLDR
" polynomial complexity theory extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems.
DNA as a universal substrate for chemical kinetics
TLDR
It is shown that systems of DNA molecules can be constructed that closely approximate the dynamic behavior of arbitrary systems of coupled chemical reactions, by using strand displacement reactions as a primitive, and systems implementing feedback digital logic and algorithmic behavior are illustrated.
Some recent developments on Shannon's General Purpose Analog Computer
  • D. Graça
  • Mathematics, Computer Science
    Math. Log. Q.
  • 2004
TLDR
It is shown that if a new notion of computability is introduced for the GPAC, based on ideas from computable analysis, then one can compute transcendentally transcendental functions such as the Gamma function or Riemann's Zeta function.
...
...