English
Related papers

Related papers: Number of hidden states needed to physically imple…

200 papers

Landauer's Principle that information loss from a computation implies entropy increase can be rigorously proved from mathematical physics. However, carefully examining its detailed formulation reveals that the traditional identification of…

Emerging Technologies · Computer Science 2018-06-28 Michael P. Frank

We consider the problem of distributing a centralised transition system to a set of asynchronous agents recognising the same language. Existing solutions are either manual or involve a huge explosion in the number of states from the…

Logic in Computer Science · Computer Science 2025-05-29 Yehia Abd Alrahman , Nir Piterman

We investigate the implementation of reduced-form allocation probabilities in a two-person bargaining problem without side payments, where the agents have to select one alternative from a finite set of social alternatives. We provide a…

Theoretical Economics · Economics 2022-02-23 Xu Lang

We compute the entropy reduction in feedback controlled systems due to the repeated operation of the controller. This was the lacking ingredient to establish the thermodynamics of these systems, and in particular of Maxwell's demons. We…

Statistical Mechanics · Physics 2009-04-12 F. J. Cao , M. Feito

We prove that if a set $X \subseteq \Z^2$ weakly self-assembles at temperature 1 in a deterministic tile assembly system satisfying a natural condition known as \emph{pumpability}, then $X$ is a finite union of semi-doubly periodic sets.…

Discrete Mathematics · Computer Science 2009-03-12 David Doty , Matthew J Patitz , Scott M Summers

Systems that are driven by a randomly timed, external protocol can seemingly violate the second law of thermodynamics. We show that this thermodynamic paradox is resolved if the outcome of the random time is stored in a memory device.…

Statistical Mechanics · Physics 2025-10-28 Izaak Neri

Motivated by wide-ranging applications such as video delivery over networks using Multiple Description Codes, congestion control, and inventory management, we study the state-tracking of a Markovian random process with a known transition…

Information Theory · Computer Science 2017-03-06 Parisa Mansourifard , Tara Javidi , Bhaskar Krishnamachari

In a closed economic system, money is conserved. Thus, by analogy with energy, the equilibrium probability distribution of money must follow the exponential Gibbs law characterized by an effective temperature equal to the average amount of…

Statistical Mechanics · Physics 2009-02-25 Adrian Dragulescu , Victor M. Yakovenko

We establish a fundamental connection between score-based diffusion models and non-equilibrium thermodynamics by deriving performance limits based on entropy rates. Our main theoretical contribution is a lower bound on the negative…

Machine Learning · Computer Science 2025-10-08 Nathan X. Kodama , Michael Hinczewski

Even simply-defined, finite-state generators produce stochastic processes that require tracking an uncountable infinity of probabilistic features for optimal prediction. For processes generated by hidden Markov chains the consequences are…

Statistical Mechanics · Physics 2021-09-15 Alexandra M. Jurgens , James P. Crutchfield

An iterative algorithm for state determination is presented that uses as physical input the probability distributions for the eigenvalues of two or more observables in an unknown state $\Phi$. Starting form an arbitrary state $\Psi_{0}$, a…

Quantum Physics · Physics 2008-04-28 Dardo M. Goyeneche , Alberto C. de la Torre

The energy landscape for soft sphere packings exists in a high-dimensional space and plays host to an astronomical number of local minima in a hierarchical and ultrametric arrangement. Each point in the landscape is a configuration that can…

Soft Condensed Matter · Physics 2025-09-04 Eddie Bautista , Eric I. Corwin

We consider the linear programming approach for constrained and unconstrained Markov decision processes (MDPs) under the long-run average cost criterion, where the class of MDPs in our study have Borel state spaces and discrete countable…

Optimization and Control · Mathematics 2021-04-20 Huizhen Yu

State resetting is a fundamental but often overlooked capability of simulators. It supports sample-based planning by allowing resets to previously encountered simulation states, and enables calibration of simulators using real data by…

Machine Learning · Computer Science 2025-11-27 Nan Jiang

In the design of probabilistic timed systems, bounded requirements concerning behaviour that occurs within a given time, energy, or more generally cost budget are of central importance. Traditionally, such requirements have been…

Logic in Computer Science · Computer Science 2016-05-19 Ernst Moritz Hahn , Arnd Hartmanns

In a partially observed quantum or classical system the information that we cannot access results in our description of the system becoming mixed even if we have perfect initial knowledge. That is, if the system is quantum the conditional…

Quantum Physics · Physics 2009-11-11 Jay Gambetta , H. M. Wiseman

State redistribution is the protocol in which, given an arbitrary tripartite quantum state, with two of the subsystems initially being with Alice and one being with Bob, the goal is for Alice to send one of her subsystems to Bob, possibly…

Quantum Physics · Physics 2017-01-12 Nilanjana Datta , Min-Hsiu Hsieh , Jonathan Oppenheim

Mismatch cost (MMC) is a universally applicable lower bound on the entropy production (EP) of any fixed physical process across a given time interval. In the first part of the paper, we establish results concerning MMC to prove that it…

Statistical Mechanics · Physics 2026-04-27 Abhishek Yadav , Francesco Caravelli , David Wolpert

Since many environmental processes such as heat waves or precipitation are spatial in extent, it is likely that a single extreme event affects several locations and the areal modeling of extremes is therefore essential if the spatial…

Methodology · Statistics 2012-08-28 Clément Dombry , Frédéric Éyi-Minko , Mathieu Ribatet

Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…

Computational Complexity · Computer Science 2019-11-11 Jonah Brown-Cohen , Prasad Raghavendra
‹ Prev 1 8 9 10 Next ›