Engines of Parsimony: Part III; Performance Trade-offs for Reversible Computers Sharing Resources

Hannah Earley

Home/Archive/arXiv

arXiv · 2012.05655

Engines of Parsimony: Part III; Performance Trade-offs for Reversible Computers Sharing Resources

Hannah Earley

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper concludes a three-Part series on the limits the laws of physics place on the sustained performance of reversible computers. Part I concerned aggregate performance in terms of computational operations per unit time, but neglected to consider interactions among computational sub-units or between computational sub-units and shared resources such as memory or chemical species. Part II extended the analysis to consider the former set of interactions. In this Part we extend the analysis to consider the latter set, with a particular focus on resource distribution in the first half. It is found that most schemes imaginable fail to function effectively in the limit of vanishing 'computational bias' $b$, which measures the net fraction of transitions which are successful, and falls as the system grows in size. Driving thermodynamically unfavourable reactions, such as resource distribution, is a very general problem for such systems and can be solved by supplying a sufficient excess of free energy. We propose a scheme to dynamically supply enough free energy for a given reaction, automatically and rapidly adapting to changes in the disequilibrium state of said reaction--including the case when the favourable reaction direction switches. The overhead of this scheme is no worse than the overhead found in Part II for communicating reversible computers under the same regime.

Explore related subjects

cond-mat.stat-mech

Keep this discovery

BibTeX RIS

Hannah Earley. 2020-12-10. Engines of Parsimony: Part III; Performance Trade-offs for Reversible Computers Sharing Resources. https://arxiv.org/abs/2012.05655

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

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗

arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗

arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗