Výsledky vyhledávání - "Taveneaux, Antoine"

Report

How much randomness is needed for statistics?

Autor: Kjos-Hanssen, Bjørn, Taveneaux, Antoine, Thapen, Neil

Publikováno v: Annals of Pure and Applied Logic 165 (2014), no. 9, 1470--1483

In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $\lambda $, a choice needs to be made. One approach is to allow randomness tests to access the measure $\lambda $ as an oracle (which

Externí odkaz: http://arxiv.org/abs/1408.2862

Zobrazit plný text záznamu

Report

The axiomatic power of Kolmogorov complexity

Autor: Bienvenu, Laurent, Romashchenko, Andrei, Shen, Alexander, Taveneaux, Antoine, Vermeeren, Stijn

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but how can we

Externí odkaz: http://arxiv.org/abs/1301.3392

Zobrazit plný text záznamu

Report

Towards an axiomatic system for Kolmogorov complexity

Autor: Taveneaux, Antoine

Publikováno v: Computability in Europe 2011 Springer LNCS volume

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. In this paper, we try to extend this work, both by looking at alternat

Externí odkaz: http://arxiv.org/abs/1102.0686

Zobrazit plný text záznamu