AMS Sectional Meeting AMS Special Session

Current as of Monday, July 10, 2017 10:14:34

Spring Eastern Sectional Meeting
Hunter College, City University of New York, New York, NY
May 6-7, 2017 (Saturday - Sunday)
Meeting #1129

Steven H Weintraub, AMS shw2@lehigh.edu

• Saturday May 6, 2017, 8:30 a.m.-10:50 a.m.
  Special Session on Computability Theory: Pushing the Boundaries, I
  HW609, Hunter West
  Organizers:
  Johanna Franklin, Hofstra University johanna.n.franklin@hofstra.edu
  Russell Miller, Queens College and Graduate Center, City University of New York
  

  • 8:30 a.m.
    Rank and randomness.
    Christopher P Porter*, Drake University
    Rupert H\"olzl, Bundeswehr University Munich
    (1129-03-441)
  • 9:00 a.m.
    Generic Muchnik reducibility and expansions of the reals.
    Mariya I. Soskova*, Sofia University
    (1129-03-406)
  • 9:30 a.m.
    A cornucopia of characterizations of cototality.
    Joseph S. Miller*, University of Wisconsin--Madison
    (1129-03-381)
  • 10:00 a.m.
    Computability theory and the game of cops and robbers on infinite graphs.
    Rachel D Stahl*, University of Connecticut
    (1129-03-120)
  • 10:30 a.m.
    A uniform reducibility in computably presented Polish spaces.
    Timothy H. McNicholl, Iowa State University
    Jason M. Rute*, Pennsylvania State University
    (1129-03-463)
• Saturday May 6, 2017, 3:00 p.m.-4:50 p.m.
  Special Session on Computability Theory: Pushing the Boundaries, II
  HW206, Hunter West
  Organizers:
  Johanna Franklin, Hofstra University johanna.n.franklin@hofstra.edu
  Russell Miller, Queens College and Graduate Center, City University of New York
  

  • 3:00 p.m.
    Analytic computable structure theory and $L^p$ spaces.
    Timothy H McNicholl*, Iowa State University
    (1129-03-123)
  • 3:30 p.m.
    Computable processes which produce any desired output in the right nonstandard model.
    Victoria Gitman*, CUNY Graduate Center
    (1129-03-258)
  • 4:00 p.m.
    The theory of the hyperarithmetic degrees as an uppersemilattice is decidable.
    James S Barnes*, Cornell University
    (1129-03-386)
  • 4:30 p.m.
    Joins in the strong Weihrauch degrees.
    Damir D Dzhafarov*, University of Connecticut
    (1129-03-382)
• Sunday May 7, 2017, 8:30 a.m.-10:50 a.m.
  Special Session on Computability Theory: Pushing the Boundaries, III
  HN C109, Hunter North
  Organizers:
  Johanna Franklin, Hofstra University johanna.n.franklin@hofstra.edu
  Russell Miller, Queens College and Graduate Center, City University of New York
  

  • 8:30 a.m.
    Asymptotic density and error correcting codes.
    Benoit Monin*, Paris XII
    (1129-68-469)
  • 9:00 a.m.
    Computability in $2^{\omega_1}$.
    Reese Johnston*, University of Wisconsin - Madison
    (1129-03-399)
  • 9:30 a.m.
    Continuous degrees and almost totality in the enumeration degrees.
    U Andrews, University of Madison, Wisconsin
    G Igusa*, University of Notre Dame
    J Miller, University of Madison, Wisconsin
    N Schweber, University of Madison, Wisconsin
    M Soskova, University of Madison, Wisconsin
    (1129-03-465)
  • 10:00 a.m.
    High / Low Hierarchies and Jump Inversion for the Bounded Jump in the Bounded Turing Degrees.
    Michael Deveau*, University of Waterloo
    (1129-03-363)
  • 10:30 a.m.
    A computable construction for exchangeable measures.
    Rehana Patel*, Wheaton College, Massachusetts
    (1129-03-489)
• Sunday May 7, 2017, 2:00 p.m.-4:20 p.m.
  Special Session on Computability Theory: Pushing the Boundaries, IV
  HN C109, Hunter North
  Organizers:
  Johanna Franklin, Hofstra University johanna.n.franklin@hofstra.edu
  Russell Miller, Queens College and Graduate Center, City University of New York
  

  • 2:00 p.m.
    What should higher reverse math be?
    Noah Schweber*, University of Wisconsin - Madison
    (1129-03-437)
  • 2:30 p.m.
    Computability and Continuous Logic.
    Wesley Calvert*, Southern Illinois University
    (1129-03-483)
  • 3:00 p.m.
    Computable categoricity on a cone and degrees of categoricity.
    Jonathan Stephenson*, University of Waterloo
    Barbara Csima, University of Waterloo
    (1129-03-306)
  • 3:30 p.m.
    Turing-, $tt$-, and $m$-reductions for functions in the Baire hierarchy.
    Adam Day, Victoria University of Wellington
    Rod Downey, Victoria University of Wellington
    Linda Brown Westrick*, University of Connecticut
    (1129-03-328)
  • 4:00 p.m.
    If a sequence converges, how computable should the rate be?
    Henry P Towsner*, University of Pennsylvania
    (1129-03-289)