About me

I received my PhD from the University of Aix-Marseille 1 (France) in April of 2008 under the supervision of Bruno Durand and Alexander Shen. I then spent a year at the Victoria University of Wellington (New Zealand), working with Rod Downey, and another 8 months at the Universtiy of Heidelberg (Germany), working with Wolfgang Merkle. As of October 2009, I am a CNRS researcher (Chargé de recherche) and member of the Automata and Applications group at the LIAFA, University of Paris 7.
[My complete CV]

My main research interest is algorithmic randomness and Kolmogorov complexity, and its connections to computability theory and analysis (more in the Links section).

News

• 2012 is a special year for computability theorists: it would have been Turing's 100th birthday. An impressive series of conferences will be held throughout the year (culminating this summer in Cambridge) [link]
• In the first half of 2013, there will be a thematic semester on Computability, Complexity and Randomness at the University of Buenos Aires [link]
• Conference on Computability and Complexity in Analysis (CCA), July 8-11 2013, Nancy, France [link]
• Computability in Europe (CiE), July 1-5 2013, Milano, Italy. [link]

Contact

Physical address
LIAFA, 175 rue du Chevaleret, 75013 Paris
7th floor, Bureau 7A9

Mailing address
LIAFA, Université Paris Diderot - Paris 7 - Case 7014
75205 Paris Cedex 13, France

E-mail
antispam-laurent.bienvenu@computability.fr

Phone
01 57 27 92 32 (from France), +33 1 57 27 92 32 (from abroad)