3 citations · 3 across the 1 of their papers we have counts for
1 paper
Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano +1
Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph…