Talks

Slides Available

Robust computation modulo "small" sets.

South Eastern Logic Symposium (SEALS) 2017, University of Florida, 4 Mar 2017.

Letting the natural numbers vote (or, upper cones for asymptotic computation).

Midwest Computability Seminar XVIII, University of Chicago, 23 Oct 2016.

The uniform content of ADS.

Computability Theory Session, ASL North American Annual Meeting, University of Connecticut, 25 May 2016.

Density and Computability.

New England Recursion and Definability Seminar (NERDS) 9.0, Springfield College, 2 Apr 2016.

Density, Intrinsic Density, and "Usually Solvable" Problems.

Logic Colloquium, University of Connecticut, 26 Feb 2016.

Slides Unavailable

Intrinsic density and computability.

CUNY Logic Workshop, CUNY Graduate Center, 6 Nov 2015.

"Almost Everywhere" in the Natural Numbers: Intrinsic Density and Effective Negligibility.

Workshop on Computability Theory, University of Bucharest, 28 June 2015.

Asymptotic Density, Immunity, and Randomness.

Computability Theory Session, CMS Winter Meeting in Hamilton, Ontario, 7 Dec 2014.

Intrinsic Density and Effective Negligibility.

Computability Seminar, University of Notre Dame, 11 Nov 2014.

Asymptotic Density, Immunity, and Randomness.

Midwest Computability Seminar XV, University of Chicago, 30 Sept 2014.

Density, Immunity, and Randomness.

Logic Seminar, University of Chicago, Mar 2013.

A computability-theoretic perspective on asymptotic density, and vice-versa.

Logic Seminar, University of Chicago, Jun 2012.

"Computable Almost Everywhere", or Generic Computability

Logic Seminar, University of Chicago, May 2011.

The Towers of Hanoi - ASAP (As *Slow* As Possible)

Graduate Student Seminar, University of Chicago, Apr 2010.