Skip to main content
Theoretical Computer Science
LaurentBienvenu's user avatar
LaurentBienvenu's user avatar
LaurentBienvenu's user avatar
LaurentBienvenu
  • Member for 14 years, 3 months
  • Last seen more than 1 year ago
Profile Activity
Stats
901
reputation
7k
reached
3
answers
0
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.
6
silver badges
5
bronze badges
Top tags
77
Score
3
Posts
100
Posts %
63
Score
1
Posts
33
Posts %
63
Score
1
Posts
33
Posts %
63
Score
1
Posts
33
Posts %
6
Score
1
Posts
33
Posts %
Top posts
answer
63
Truly random number generator: Turing computable?
Sep 17, 2010
answer
8
Is the following language in RE?
Sep 18, 2010
answer
6
Complexity relative to the graph of the Busy-Beaver function
Jun 26, 2020
Top network posts
View all network posts
13
Turing degrees of sets separating two computably inseparable sets (theorems and antitheorems)
8
Martin-Löf randomness relative to a $\Delta^0_2$-representation of a real
7
Error correcting codes - basic question
7
Probability of Brownian motion to have a zero in an interval
6
Decidability of prime gap sequences