Kevin Zhou : A Crash Course in Algorithmic Randomness

Posted by Kevin Zhou , part of the Louise Hay Logic Seminar.

At

Sept. 5, 2019, 4 p.m.

In

427 SEO

Abstract

We will give an overview of the basics of algorithmic randomness, with a view towards understanding some recent theorems of Reimann and Slaman. Some familiarity with basic computability theory will be helpful but not required.