Randomized algorithms in computability theory - Part II

Laurent Bienvenu, University of Montpellier

This talk will elaborate on the Oct 30 colloquium. I will give details on several proofs, in particular how to show a $\Pi^0_1$ class is deep, applications of depth to other computability-theoretic notions, and how to use fireworks arguments with other forcing notions than Cohen-type forcing. Though attending the colloquium would give motivation and context for the topics we will discuss, the talk will be self-contained.

MC 5413