3 citations · 4 across the 5 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.DS2015★ 3 cited
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…
math.DS2015★ 1 cited
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…