Midwest Computability Seminar

XXIV


The Midwest Computability Seminar is a joint venture between the University of Chicago, the University of Notre Dame, and the University of Wisconsin-Madison. It meets once or twice per semester at the University of Chicago, and is attended by faculty and students from these universities and others in the area. The seminar started in the fall of 2008.

DATE: Tuesday, February 11th, 2020.
PLACE: Ryerson Hall 352 (the Barn), The University of Chicago.
1100 East 58th Street, Chicago, IL 60637.


Speakers:

Schedule:


Abstracts:

Rachael Alvir

Title: Scott sentences

Abstract: In this talk, we will give various results on Scott sentences.


Tejas Bhojraj

Title: Quantum algorithmic randomness

Abstract: I will introduce the basic notions of quantum algorithmic randomness and then state a few results. Time permitting, I will sketch proofs of the following two results: (1) quantum Martin-Löf randomness is equivalent to quantum Solovay randomness and (2) quantum Schnorr random states satisfy a quantum version of the Law of large numbers.


Jun Le Goh

Title: Computing Descending Sequences in Linear Orderings

Abstract: We investigate how hard it is to compute a descending sequence in a given ill-founded linear ordering, in the framework of Weihrauch reducibility. Joint work with Arno Pauly and Manlio Valenti.


Neil Lutz

Title: Fractal Slices, Projections, and Products via Algorithmic Dimension

Abstract: This talk will describe recent progress in using Kolmogorov complexity and point-to-set principles to remove structural hypotheses from prominent classical theorems in fractal geometry. These include Marstrand's slicing theorem, Marstrand's projection theorem, and a characterization of packing dimension in terms of product sets.


Previous Seminars:

If you haven't been receiving the announcements and would like to be included in the list, send an email to drh@math.uchicago.edu.