Meetings

National International Sectional Current Meetings Previous Meetings Presenting Papers Hosting Sectional Meetings Short Courses AMS Conferences Special Lectures Mathematics Calendar In Cooperation with Submitting Abstracts

AMS Sectional Meeting Program by AMS Special Session

Current as of Saturday, November 13, 2010 00:34:10

---

Program  |  Deadlines  |  Registration/Housing/Etc.
Inquiries: meet@ams.org

---

2010 Fall Central Section Meeting
Notre Dame, IN, November 5-7, 2010 (Friday - Sunday)
Meeting #1064

Associate secretaries:
Georgia Benkart, AMS benkart@math.wisc.edu

---

Special Session on Computability and Its Applications

• Friday November 5, 2010, 2:30 p.m.-4:20 p.m.
  Special Session on Computability and Its Applications, I
  Room 120, DeBartolo Hall
  Organizers:
  Peter Cholak, University of Notre Dame Peter.Cholak.1@nd.edu
  Peter Gerdes, University of Notre Dame gerdes@invariant.org
  Karen Lange, University of Notre Dame klange1@nd.edu
  

  • 2:30 p.m.
    Degrees of Categoricity.
    Barbara F. Csima, Department of Pure Mathematics, University of Waterloo
    Johanna N.Y Franklin, Department of Mathematics, Dartmouth College
    Richard A. Shore*, Department of Mathematics, Cornell University
    (1064-03-61)
  • 3:00 p.m.
    Symbolic dynamics: entropy = Hausdorff dimension = Kolmogorov complexity.
    Stephen G. Simpson*, Department of Mathematics, Pennsylvania State University
    (1064-03-243)
  • 3:30 p.m.
    Recovering randomness from an asymptotic Hamming distance.
    Bjørn Kjos-Hanssen*, University of Hawaii at Manoa
    (1064-03-270)
  • 4:00 p.m.
    Games in Computability Theory.
    Robert Irving Soare*, The University of Chicago
    (1064-03-77)
• Saturday November 6, 2010, 8:00 a.m.-10:50 a.m.
  Special Session on Computability and Its Applications, II
  Room 120, DeBartolo Hall
  Organizers:
  Peter Cholak, University of Notre Dame Peter.Cholak.1@nd.edu
  Peter Gerdes, University of Notre Dame gerdes@invariant.org
  Karen Lange, University of Notre Dame klange1@nd.edu
  

  • 8:00 a.m.
    Computability and uncountable linear orders.
    Noam Greenberg, Victoria University of Wellington
    Asher M. Kach, University of Connecticut-Storrs
    Steffen Lempp*, University of Wisconsin-Madison
    Daniel D. Turetsky, Victoria University of Wellington
    (1064-03-238)
  • 8:30 a.m.
    Degrees of members of $\Pi^0_1$ classes.
    Keng Meng Ng*, University of Wisconsin-Madison
    (1064-03-325)
  • 9:00 a.m.
    Martin-Löf randomness and Birkhoff's ergodic theorem.
    Johanna N.Y. Franklin*, Dartmouth College
    Noam Greenberg, Victoria University of Wellington
    Joseph S. Miller, University of Wisconsin, Madison
    Keng Meng Ng, University of Wisconsin, Madison
    (1064-03-202)
  • 9:30 a.m.
    Low LR upper bounds.
    David Diamondstone*, University of Chicago
    (1064-03-177)
  • 10:00 a.m.
    A bounded jump for the bounded Turing degrees.
    Barbara F. Csima*, University of Waterloo
    Bernard A. Anderson, University of Waterloo
    (1064-03-239)
  • 10:30 a.m.
    Structural Characteristics of Recursion Theoretic Properties.
    Theodore A. Slaman*, University of California Berkeley
    Antonio Montalban, University of Chicago
    Noam Greenberg, Victoria University of Wellington
    (1064-03-303)
• Saturday November 6, 2010, 2:30 p.m.-5:20 p.m.
  Special Session on Computability and Its Applications, III
  Room 120, DeBartolo Hall
  Organizers:
  Peter Cholak, University of Notre Dame Peter.Cholak.1@nd.edu
  Peter Gerdes, University of Notre Dame gerdes@invariant.org
  Karen Lange, University of Notre Dame klange1@nd.edu
  

  • 2:30 p.m.
    Effective geometric measure theory.
    Jan S Reimann*, Pennsylvania State University
    (1064-03-230)
  • 3:00 p.m.
    Sets automorphic to low sets.
    Rebecca Weber*, Department of Mathematics, Dartmouth College
    (1064-03-210)
  • 3:30 p.m.
    Reverse mathematics and the finite intersection principle.
    Damir D Dzhafarov*, University of Chicago
    (1064-03-261)
  • 4:00 p.m.
    Reverse mathematics and infinite traceable graphs.
    Peter Cholak, University of Notre Dame
    David Galvin, University of Notre Dame
    Reed Solomon*, University of Connecticut
    (1064-03-215)
  • 4:30 p.m.
    The search for natural definability in the Turing degrees.
    Andrew Edwin Marcus Lewis*, University of Leeds, UK
    (1064-03-298)
  • 5:00 p.m.
    Computable Categoricity for Algebraic Fields.
    Denis R. Hirschfeldt*, University of Chicago
    Russell Miller, Queens College and The Graduate Center, C.U.N.Y.
    Alexandra Shlapentokh, East Carolina University
    (1064-03-120)
• Sunday November 7, 2010, 8:00 a.m.-11:50 a.m.
  Special Session on Computability and Its Applications, IV
  Room 120, DeBartolo Hall
  Organizers:
  Peter Cholak, University of Notre Dame Peter.Cholak.1@nd.edu
  Peter Gerdes, University of Notre Dame gerdes@invariant.org
  Karen Lange, University of Notre Dame klange1@nd.edu
  

  • 8:00 a.m.
    Revisiting Cooper's jump inversion theorem.
    Joseph S. Miller*, University of Wisconsin---Madison
    (1064-03-219)
  • 8:30 a.m.
    A hyperimmune-low basis theorem for infinitely branching trees.
    Chris J. Conidis*, Department of Pure Mathematics, University of Waterloo
    (1064-03-315)
  • 9:00 a.m.
    Birkhoff's theorem and reverse mathematics.
    Paul Shafer*, Cornell University
    (1064-03-272)
  • 9:30 a.m.
    The non-hyperarithmetic degrees form a spectrum.
    Antonio Montalban*, University of Chicago
    (1064-03-78)
  • 10:00 a.m.
    Jump Degrees of Countable Structures.
    Brooke M. Andersen, Assumption College
    Asher M. Kach*, University of Connecticut - Storrs
    Bakhadyr Khoussainov, University of Auckland
    Alexander G. Melnikov, University of Auckland
    D. Reed Solomon, University of Connecticut - Storrs
    (1064-03-241)
  • 10:30 a.m.
    A direct construction of a hyperimmune minimal degree.
    Mingzhong Cai*, Department of Mathematics, Cornell University
    (1064-03-265)
  • 11:00 a.m.
    Definability and Automorphisms of the C.E. Sets.
    Rachel Epstein*, Harvard University
    (1064-03-183)
  • 11:30 a.m.
    Generic computability, Turing degrees, and asymptotic density.
    Carl Jockusch*, University of Illinois at Urbana-Champaign
    Paul Schupp, University of Illinois at Urbana-Champaign
    (1064-03-166)

Inquiries: meet@ams.org

---

Quick Links

Special Session Manual

Guidelines for speakers