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 4 years ago
Profile Activity
Stats
901
reputation
0
reached
0
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.
4
silver badges
1
bronze badge
Posts

This user hasn’t posted yet.

Top network posts
View all network posts
63
Truly random number generator: Turing computable?
13
Turing degrees of sets separating two computably inseparable sets (theorems and antitheorems)
8
Is the following language in RE?
8
Martin-Löf randomness relative to a $\Delta^0_2$-representation of a real
7
Error correcting codes - basic question