Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.08859

Computing with reaction networks at input-independent speed: exponential and logarithmic functions

David F. Anderson·Badal Joshi·Tung D. Nguyen
View original source ↗Read source document ↗Export metadata ↓

Abstract

The concept of \textit{input-independent computational speed} for chemistry-based analog computers was introduced in Anderson-Joshi (2025), where it was shown that arithmetic operations can be computed with a convergence rate bounded below independently of the input values. Here, by inputs we mean the numerical values encoded by the initial concentrations of designated input species, with the underlying reaction network and rate constants held fixed. Combining these operations via power series to approximate transcendental functions is possible in principle, but the number of chemical species required grows with the number of terms retained, and achieving sufficient accuracy may demand many terms---a burden that is especially severe for slowly converging series such as the power series for the logarithm. In this paper, we begin the program of directly computing transcendental functions by chemical reaction networks by focusing on the exponential and logarithmic functions, two widely used transcendental functions, and constructing reaction network modules that compute them without relying on truncated power series. We show that the resulting modules are mass-action systems, and prove that they achieve arbitrary accuracy given sufficient time while operating at input-independent speed. Moreover, these modules can be combined with each other and with the arithmetic modules of Anderson-Joshi (2025): any such composite computation also runs at input-independent speed, with a convergence rate that does not depend on the length of the feedforward chain. Logarithm and exponential functions serve as foundational cases, and the constructions developed here are intended to serve as templates for the direct computation of more general transcendental functions by chemical reaction networks.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David F. Anderson, Badal Joshi, Tung D. Nguyen. 2026-04-10. Computing with reaction networks at input-independent speed: exponential and logarithmic functions. https://arxiv.org/abs/2604.08859

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS↗
arXiv2026

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS↗
arXiv2026

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS↗