7 citations · 17 across the 21 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.ST2009
Influence tests I: ideal composite hypothesis tests, and causal semimeasures
Bruno Bauwens
Ratios of universal enumerable semimeasures corresponding to hypotheses are investigated as a solution for statistical composite hypotheses testing if an unbounded amount of comput…
cs.CC2009★ 2 cited
On the equivalence between minimal sufficient statistics, minimal typical models and initial segments of the Halting sequence
Bruno Bauwens
It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computabl…
cs.IT2009★ 1 cited
Additivity of on-line decision complexity is violated by a linear term in the length of a binary string
Bruno Bauwens
We show that there are infinitely many binary strings z, such that the sum of the on-line decision complexity of predicting the even bits of z given the previous uneven bits, and t…