Related papers: Information dynamics and the arrow of time
Many physicists think that the maximum entropy formalism is a straightforward application of Bayesian statistical ideas to statistical mechanics. Some even say that statistical mechanics is just the general Bayesian logic of inductive…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
We postulate a principle stating that the initial condition of a physical system is typically algorithmically independent of the dynamical law. We argue that this links thermodynamics and causal inference. On the one hand, it entails…
All the laws of physics are time-reversible. Time arrow emerges only when ensembles of classical particles are treated probabilistically, outside of physics laws, and the entropy and the second law of thermodynamics are introduced. In…
The second law of thermodynamics - the usual statement of the arrow of time - has been called the most fundamental law of physics. It is thus difficult to conceive that a single dynamical system could contain subsystems, in significant…
We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be…
Unlike most other laws of nature, the second law of thermodynamics is of a statistical nature, according to Boltzmann, meaning that its reliability arises from the vast number of particles present in macroscopic systems. This means that…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…
We revisit the problem of finding the conditions under which synchronous probabilistic cellular automata indexed by the line $\mathbb{Z}$, or the periodic line $\cyl{n}$, depending on 2 neighbours, admit as invariant distribution the law of…
The epistemic arrow of time is the fact that our knowledge of the past seems to be both of a different kind and more detailed than our knowledge of the future. Just like with the other arrows of time, it has often been speculated that the…
In 1979 Penrose hypothesized that the arrows of time are explained by the hypothesis that the fundamental laws are time irreversible. That is, our reversible laws, such as the standard model and general relativity are effective, and emerge…
We propose using Probabilistic Cellular Automata (PCA) to address inverse problems with the Bayesian approach. In particular, we use PCA to sample from an approximation of the posterior distribution. The peculiar feature of PCA is their…
Within the general formalism of quantum theory irreversibility and the arrow of time in the evolution of various physical systems are studied. Irreversible behavior often manifests itself in the guise of entropy production. This motivates…
We provide a dynamical proof of the second law of thermodynamics, along the lines of an argument of Penrose and Gibbs, making crucial use of the upper semicontinuity of the mean entropy proved by Robinson and Ruelle and Lanford and…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
For decades, researchers have sought to understand how the irreversibility of the surrounding world emerges from the seemingly time symmetric, fundamental laws of physics. Quantum mechanics conjectured a clue that final irreversibility is…