7 citations · 17 across the 21 of their papers we have counts for
1 paper · 1 filter
Bruno Bauwens
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near suffic…