相关论文: Uncomputably noisy ergodic limits

Computable and sharp error bounds are derived for asymptotic expansions for linear differential equations having a simple turning point. The expansions involve Airy functions and slowly varying coefficient functions. The sharpness of the…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…

Von Neumann's original proof of the ergodic theorem is revisited. A uniform convergence rate is established under the assumption that one can control the density of the spectrum of the underlying self-adjoint operator when restricted to…

We use nonstandard analysis to study the problem of expressing a Gaussian integral in terms of the limiting behavior of a sequence of spherical integrals. Peterson and Sengupta proved that if a Gaussian measure $\mu$ has full support on a…

This note provides an effective bound in the Gauss-Kuzmin-L\'evy problem for some Gauss type shifts associated with nearest integer continued fractions, acting on the interval $I_0=[0,\frac{1}{2}]$ or $I_0=[-\frac{1}{2},\frac{1}{2}]$. We…

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…

We propose an efficient and flexible method for solving Abel integral equation of the first kind, frequently appearing in many fields of astrophysics, physics, chemistry, and applied sciences. This equation represents an ill-posed problem,…

Given sequence of measure preserving transformations $\{U_k:\,k=1,2,\ldots, n\}$ on a measurable space $(X,\mu)$. We prove a.e. convergence of the ergodic means \begin{equation} \frac{1}{s_1\cdots…

Convergence properties of random ergodic averages have been extensively studied in the literature. In these notes, we exploit a uniform estimate by Cohen \& Cuny who showed convergence of a series along randomly perturbed times for…

For a countable abelian group $G$ we investigate generic properties of the space of all invariant metrics on $G$. We prove that for every such an unbounded group $G$, i.e. group which has elements of arbitrarily high order, there is a dense…

Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…

We demonstrate a fast spin-s spherical harmonic transform algorithm, which is flexible and exact for band-limited functions. In contrast to previous work, where spin transforms are computed independently, our algorithm permits the…

We offer a generalization of the recent result of Tao (building on earlier results of Conze and Lesigne, Furstenberg and Weiss, Zhang, Host and Kra, Frantzikinakis and Kra and Ziegler) that the nonconventional ergodic averages associated to…

It is shown that there exist a subsequence for which the multiple ergodic averages of commuting invertible measure preserving transformations of a Lebesgue probability space converge almost everywhere provided that the maps are weakly…

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

Let $H$ be the space of all Hermitian matrices of infinite order and $U(\infty)$ be the inductive limit of the chain $U(1)\subset U(2)\subset...$ of compact unitary groups. The group $U(\infty)$ operates on the space $H$ by conjugations,…

Let $(X,\mu)$ be an arbitrary measure space equipped with a family of pairwise commuting measure preserving transformations $T_1, \dotsc, T_m$. We prove that the ergodic averages \[ A_{N;X}^{P_1, \dotsc, P_m}f = \frac{1}{N} \sum_{n=1}^N…