16 citations · 45 across the 11 of their papers we have counts for
1 paper · 1 filter
Laurent Bienvenu, Rod Downey
Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we cons…