3 citations · 3 across the 2 of their papers we have counts for
3 papers
math.LO2014★ 3 cited
How much randomness is needed for statistics?
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure , a choice needs to be made. One approach is to allow randomn…
math.LO2013
The axiomatic power of Kolmogorov complexity
Laurent Bienvenu, Andrei Romashchenko, Alexander Shen +2
The famous Gödel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements wo…
cs.IT2011
Towards an axiomatic system for Kolmogorov complexity
Antoine Taveneaux
In [She82], it is shown that four basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion.…