16 citations · 54 across the 28 of their papers we have counts for
5 papers · 1 filter
Diagonally non-computable functions and fireworks
Laurent Bienvenu, Ludovic Patey
A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be neg…
On the logical strengths of partial solutions to mathematical problems
Laurent Bienvenu, Ludovic Patey, Paul Shafer
We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to…
On zeros of Martin-Löf random Brownian motion
Kelty Allen, Laurent Bienvenu, Theodore Slaman
We investigate the sample path properties of Martin-Löf random Brownian motion. We show (1) that many classical results which are known to hold almost surely hold for every Martin-…
Algorithmic identification of probabilities is hard
Laurent Bienvenu, Santiago Figueira, Benoit Monin +1
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter . By the law of large numbers, the frequency of zeros in the sequence…
Deep Classes
Laurent Bienvenu, Christopher P. Porter
A set of infinite binary sequences is negligible if there is no partial probabilistic algorithm that produces an element of this set with positive probabi…