3 citations · 3 across the 5 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2023
Kolmogorov Last Discovery? (Kolmogorov and Algorithmic Statictics)
Alexey Semenov, Alexander Shen, Nikolay Vereshchagin
The last theme of Kolmogorov's mathematics research was algorithmic theory of information, now often called Kolmogorov complexity theory. There are only two main publications of Ko…
math.LO2019
Descriptive Complexity of Computable Sequences Revisited
Nikolay Vereshchagin
The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Sci…
math.LO2014★ 3 cited
Short lists with short programs for functions
Nikolay Vereshchagin
Let be an optimal Gödel numbering of the family of computable functions (in Schnorr's sense), where ranges over binary strings. Assume that a list of strings i…