3.7k citations · 21.4k across the 163 of their papers we have counts for
1 paper · 2 filters
C. Adami, N. J. Cerf
A practical measure for the complexity of sequences of symbols (``strings'') is introduced that is rooted in automata theory but avoids the problems of Kolmogorov-Chaitin complexit…