93 citations · 178 across the 12 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2010★ 3 cited
Effective complexity of stationary process realizations
Nihat Ay, Markus Mueller, Arleta Szkola
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by me…
cs.IT2006★ 1 cited
Stationary Algorithmic Probability
Markus Mueller
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal…