Last updated: February 2016

Slides from Conference and Seminar Talks

A promptly simple set that is not superlow cuppable, Conference on Computability, Complexity, and Randomness (CCR08), Nanjing, China, May 19, 2008.

Two equivalent definitions of random closed sets, Midwest Computability Seminar III, Chicago, USA, February 3, 2009.

Low LR upper bounds, Workshop in Computability Theory, Paris, France, July 24, 2010.
(An abridged version of this talk was given at the fall AMS meeting at Notre Dame, November 6, 2010.)

Enumerability of Strongly Jump-Traceables, 12th Asian Logic Conference, Wellington, New Zealand, December 15, 2011.