From October 2009 to April 2013, I worked on a Ph.D in Mathematical Logic at the University of Leeds.

My supervisors were the late S. Barry Cooper (obituary) and Andy Lewis.

Computability theory and algorithmic randomness

The topic of my thesis was computability theory, and more specifically algorithmic randomness.

I've written a quick introduction to algorithmic randomness for this website.

My full thesis is titled "Notions and applications of algorithmic randomness" (pdf, 801 kB).

Papers and other mathematical downloads:

Icons from Flaticon