Skip to main content
MathOverflow
Laurent Bienvenu's user avatar
Laurent Bienvenu's user avatar
Laurent Bienvenu's user avatar
Laurent Bienvenu
  • Member for 13 years, 11 months
  • Last seen this week
Profile Activity
Stats
678
reputation
7k
reached
4
answers
5
questions
Communities
About

CNRS researcher at the University of Bordeaux, working on computability theory, in particular algorithmic randomness and Kolmogorov complexity.

Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
12
bronze badges
Top tags
View all tags
24
Score
5
Posts
56
Posts %
18
Score
3
Posts
33
Posts %
13
Score
1
Posts
11
Posts %
6
Score
1
Posts
11
Posts %
3
Score
2
Posts
22
Posts %
0
Score
2
Posts
22
Posts %
Top posts
answer
13
Turing degrees of sets separating two computably inseparable sets (theorems and antitheorems)
Sep 15, 2023
question
7
Error correcting codes - basic question
Feb 11, 2012
question
7
Probability of Brownian motion to have a zero in an interval
Mar 11, 2014
question
7
Martin-Löf randomness relative to a $\Delta^0_2$-representation of a real
Apr 2, 2014
answer
6
Decidability of prime gap sequences
Mar 28, 2014
question
4
An application of Baire category theorem
Jan 9, 2011
answer
3
Are there recursive sets $X$ with Property A that contain infinitely many incompressible strings?
Jan 5, 2017
question
2
Brownian motion & time shift
May 19, 2012
answer
2
Probabilistic generalization of trial-and-error predicates
Aug 31, 2018
Top network posts
View all network posts
63
Truly random number generator: Turing computable?
8
Is the following language in RE?
6
Complexity relative to the graph of the Busy-Beaver function