16 citations · 54 across the 28 of their papers we have counts for
Showing 2018 · math.LOShow all
2 papers · 2 filters
math.LO2018
Optimal bounds for single-source Kolmogorov extractors
Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor
The rate of randomness (or dimension) of a string is the ratio where is the Kolmogorov complexity of . While it is known that a single computable transform…
math.LO2018★ 1 cited
On the interplay between effective notions of randomness and genericity
Laurent Bienvenu, Christopher P. Porter
In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence…