Midwest Computability Seminar


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.

: Tuesday, April 2, 2013.
PLACE: Ryerson Hall 352 (the Barn), The University of Chicago.
1100 East 58th Street, Chicago, IL 60637.




Howard Becker
Title: Strange structures from computable model theory
Abstract: Let L be a countable language, let I be an isomorphism-class of countable L-structures, and let a be a real. I is a-"strange" if it contains an element computable-from-a and its Scott rank is exactly ωa1. For all a, a-strange structures exist. Theorem (AD): If C is a collection of ℵ1 isomorphism-classes of countable structures, then for a Turing-cone of reals a, no member of C is a-strange.

Denis Hirschfeldt
Title: Coarse computability and algorithmic randomness
Abstract: I will describe an application of the theory of algorithmic randomness to the study of coarse computability, using it as a focal point for a discussion of old and recent results on the interactions between random sets, highly nonrandom sets, and Turing reducibility.

Paul Schupp
Title: Asymptotic density and computability
Abstract: The "asymptotic-generic" point of view is currently a major feature of geometric group theory. I will discuss recent applications of this point of view to the theory of computability such as generic computability and complexity, the densities of computable and computably enumerable sets, a characterization of non-low c.e. degrees, and the idea of coarse computability.

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.