3 citations · 3 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.IT2026
Maximal Kolmogorov Complexity in a Hamming Ball
Alexander Kozachinskiy, Nikolay Vereshchagin
The minimal Kolmogorov complexity of a string within Hamming distance r of a given string x is the algorithmic rate-distortion function of x, and Vereshchagin and Vitanyi character…
math.DS2026
Matching Rules for Substitution and Hierarchical Tilings for any Substitution with Finite Local Complexity
Nikolay Vereshchagin
The Goodman-Strauss theorem states that for ``almost every'' substitution , the family of substitution tilings is sofic, that is, it can be defined by local matching rules for s…