2 papers
math.LO2012
From Bi-immunity to Absolute Undecidability
Laurent Bienvenu, Rupert Hölzl, Adam R. Day
An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of…
cs.CC2009
Separations of non-monotonic randomness notions
Laurent Bienvenu, Rupert Hoelzl, Thorsten Kraling +1
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mart…