3 citations · 4 across the 5 of their papers we have counts for
5 papers · 1 filter
On effective Birkhoff's ergodic theorem for computable actions of amenable groups
Nikita Moriakov
We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let be a computable amenable group, then there al…
Hochman's upcrossing theorem for groups of polynomial growth
Nikita Moriakov
Consider a stochastic process , which is indexed by the collection of all nonempty intervals and whic…
Fluctuations of Ergodic Averages for Actions of Groups of Polynomial Growth
Nikita Moriakov
It was shown by S. Kalikow and B. Weiss that, given a measure-preserving action of on a probability space and a nonnegative measurable function on , the p…
Computable Følner monotilings and a theorem of Brudno I
Nikita Moriakov
The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over to the Kolmogorov complexity of words…
Computable Følner monotilings and a theorem of Brudno II
Nikita Moriakov
A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over with respect to an ergodic measure equals the asymptotic Kolmogorov complexity…