English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Developing a physical theory of computation is an open challenging task atthe interface of non-equilibrium thermodynamics and computer science. Animportant part of this task requires the examination of thermodynamicquantities in formal models of computers which execute computational tasks,such as automata or word-RAM models executing algorithms. This implies dealingwith a number of difficulties such as stochastic halting times, unidirectional(possibly deterministic) transitions, and restricted initial conditions. Here,we present a framework which tackles all such difficulties by extendingmartingale theory of nonequilibrium thermodynamics to non-stationary Markoviandynamics with broken local detailed balance and absolute irreversibility. Indoing so, we derive universal fluctuation relations and second-law-likeinequalities that provide both lower and upper bounds for the intrinsicdissipation (mismatch cost) associated with any computation performed overarbitrary stochastic times, so long as it is implemented with a periodicprocess. We then provide universal equalities and inequalities for theacceptance probability of words of a given length by a computer in terms ofthermodynamic quantities, and outline connections between computer science andstochastic resetting. We illustrate most of our results with exhaustivenumerical simulations of fundamental models of computation from theoreticalcomputer science, namely deterministic finite automata processing bit strings.Our results, while motivated from the computational context, are applicable farbeyond it.

Thermodynamics of computations with absolute irreversibility, unidirectional transitions, and stochastic computation times