Overview

Date: Sunday, April 7, 2013
Place: Boston College

The meeting is the Special Session “Recursion and Definability” of the AMS Meeting in April 2012, and is organized by Rachel Epstein, Karen Lange and Russell Miller.

Schedule

9:30am	Brooke Andersen (Assumption College)	Using complete sets to distinguish reducibilities
10am	Bjorn Poonen (Massachusetts Institute of Technology)	Some undecidable problems
11am	Lunch
3pm	Richard Shore (Cornell University)	The Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength
4pm	Johanna Franklin (University of Connecticut)	Weak Demuth randomness and computational strength
4:30pm	Rehana Patel (Olin College of Engineering)	A Random Walk Through Zero-One Laws for Classes of Graphs with a Forbidden Subgraph
5pm	Nathanael Ackerman (Harvard University)	Computability of 0-1 Laws

Abstracts

For abstracts, consult the page of the AMS Special Session.