This workshop intends to gather researchers interested by computability theory and its interactions with algorithmic randomness. It will take place at the LIAFA (University of Paris 7), 175 rue du Chevaleret, Paris.

Topics

The main topics of the meeting will be:

• Algorithmic randomness
• Algorithmic information theory
• Computable analysis
• Computability theory
• Kolmogorov complexity
• Reverse mathematics, logic and set theory

Contact

The workshop is organized by Laurent Bienvenu, Rupert Hölzl and Antoine Taveneaux.

• Email: Laurent Bienvenu (laurent.bienvenu[at]liafa.jussieu.fr)

 

---