Related papers: Uncomputably noisy ergodic limits

We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…

We prove that ergodic measures on one-sided shift spaces are uniformly scaling in the sense of Gavish. That is, given a shift ergodic measure we prove that at almost every point the scenery distributions weakly converge to a common…

This paper presents an analysis of the concept of capacity for noisy com- putations, i.e. functions implemented by unreliable or random devices. An information theoretic model of noisy computation of a perfect function f (measurable…

We investigate the computability (in the sense of computable analysis) of the topological pressure $P_{\rm top}(\phi)$ on compact shift spaces $X$ for continuous potentials $\phi:X\to {\mathbb R}$. This question has recently been studied…

Let $S$ and $T$ be measure-preserving transformations of a probability space $(X,{\mathcal B},\mu)$. Let $f$ be a bounded measurable functions, and consider the integrals of the corresponding `double' ergodic averages:…

We prove that the divisor function $d(n)$ counting the number of divisors of the integer $n$, is a good weighting function for the pointwise ergodic theorem. For any measurable dynamical system $(X, {\mathcal A},\nu,\tau)$ and any $f\in…

In this paper, we prove a new type of energy estimates for the compressible Euler's equation with free boundary, with a boundary part and an interior part. These can be thought of as a generalization of the energies in Christodoulou and…

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…

We obtain non-asymptotic Gaussian concentration bounds for the difference between the invariant measure $\nu$ of an ergodic Brownian diffusion process and the empirical distribution of an approximating scheme with decreasing time step along…

There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results, showing that topological pressure is always computable from…

Designing capacity-achieving coding schemes for the band-limited additive colored Gaussian noise (ACGN) channel has been and is still a challenge. In this paper, the capacity of the band-limited ACGN channel is studied from a fundamental…

Let $(X, \mathcal{A},\mu)$ be a probability space and let $T$ be a contraction on $L^2(\mu)$. We provide suitable conditions over sequences $(w_k)$, $(u_k)$ and $(A_k)$ in such a way that the weighted ergodic limit…

We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension. First, through a new sample complexity result we establish the rate of…

We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a…

One of the fundamental results of ergodic optimization asserts that for any dynamical system on a compact metric space with the specification property and for a generic continuous function $f$ every invariant probability measure that…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…