AMS Sectional Meeting AMS Special Session

Current as of Monday, April 1, 2019 03:30:05

Spring Central and Western Joint Sectional Meeting

• University of Hawaii at Manoa, Honolulu, HI
• March 22-24, 2019 (Friday - Sunday)
• Meeting #1147

Georgia Benkart, AMS benkart@math.wisc.edu
Michel L Lapidus, AMS lapidus@math.ucr.edu, lapidus@mathserv.ucr.edu

• Friday March 22, 2019, 3:00 p.m.-4:20 p.m.
  Special Session on Computability, Complexity, and Learning, I
  Room 213, George Hall
  Organizers:
  Achilles A. Beros, University of Hawaii at Manoa
  Bjørn Kjos-Hanssen, University of Hawaii at Manoa bjoernkh@hawaii.edu
  

  • 3:00 p.m.
    Muchnik degrees and Medvedev degrees of the randomness notions.
    Kenshi Miyabe*, Meiji University, Department of Mathematics
    (1147-03-167)
  • 3:30 p.m.
    Turing Degrees and Randomness for Continuous Measures.
    Mingyang Li, Pennsylvania State University
    Jan Reimann*, Pennsylvania State University
    (1147-03-714)
  • 4:00 p.m.
    Open Questions on Notions of Dense Computability.
    Eric P. Astor, Google LLC
    Denis R. Hirschfeldt*, University of Chicago
    Carl G. Jockusch, Jr., University of Illinois
    (1147-03-628)
• Saturday March 23, 2019, 9:00 a.m.-10:50 a.m.
  Special Session on Computability, Complexity, and Learning, II
  Room 213, George Hall
  Organizers:
  Achilles A. Beros, University of Hawaii at Manoa
  Bjørn Kjos-Hanssen, University of Hawaii at Manoa bjoernkh@hawaii.edu
  

  • 9:00 a.m.
    The extraction rate of Turing functionals.
    Douglas Cenzer*, University of Florida
    Chris Porter, Drake University
    (1147-03-540)
  • 9:30 a.m.
    On the Usefulness of Characterization Theorems in the Inductive Inference of Recursive Functions--Preliminary Report.
    Thomas Zeugmann*, Hokkaido University, Japan
    (1147-68-567)
  • 10:00 a.m.
    Learning on Effective Concept Classes.
    Wesley Calvert*, Southern Illinois University
    (1147-03-740)
  • 10:30 a.m.
    Algorithmic identification of probabilities is hard.
    Laurent Bienvenu*, LaBRI, CNRS & Université de Bordeaux
    Santiago Figueira, Universidad de Buenos Aires and CONICET
    Benoit Monin, LACL, Université Paris 12
    Alexander Shen, LIRMM, CNRS & Université de Montpellier
    (1147-03-674)
• Saturday March 23, 2019, 2:00 p.m.-4:20 p.m.
  Special Session on Computability, Complexity, and Learning, III
  Room 213, George Hall
  Organizers:
  Achilles A. Beros, University of Hawaii at Manoa
  Bjørn Kjos-Hanssen, University of Hawaii at Manoa bjoernkh@hawaii.edu
  

  • 2:00 p.m.
    Complexity in the ceers.
    Noah Schweber*, University of Wisconsin - Madison
    Uri Andrews, University of Wisconsin - Madison
    Andrea Sorbi, University of Siena
    (1147-03-908)
  • 2:30 p.m.
    Canonical immunity and genericity.
    Konstantinos A. Beros*, Miami University
    Achilles A. Beros, University of Hawaii at Manoa
    (1147-03-760)
  • 3:00 p.m.
    Decision problems in algebraic structures.
    Jennifer Chubb*, University of San Francisco
    Iva Bilanovic, George Washington University
    Sam Roven, University of Washington
    (1147-03-858)
  • 3:30 p.m.
    Properties of One-sided Randomness.
    Samuel Birns*, University of Hawaii at Manoa
    (1147-03-173)
  • 4:00 p.m.
    Complexity of problems in computable structure theory.
    Valentina Harizanov*, George Washington University
    (1147-03-813)
• Sunday March 24, 2019, 9:00 a.m.-10:50 a.m.
  Special Session on Computability, Complexity, and Learning, IV
  Room 213, George Hall
  Organizers:
  Achilles A. Beros, University of Hawaii at Manoa
  Bjørn Kjos-Hanssen, University of Hawaii at Manoa bjoernkh@hawaii.edu
  

  • 9:00 a.m.
    The Reverse Sorites.
    Damir D Dzhafarov*, University of Connecticut
    (1147-03-724)
  • 9:30 a.m.
    The Infinite Rays Theorem: Complexity and Reverse Mathematics: A Theorem of Hyperarithmetic Analysis.
    James Barnes, Department of Mathematics, Wellesely College
    Jun Le Goh, Department of Mathematics, Cornell University
    Richard A Shore*, Department of Mathematics, Cornell University
    (1147-03-169)
  • 10:00 a.m.
    A recursion theoretical solution to Johnson's question.
    Liang Yu*, Math Dept, Nanjing University
    (1147-03-71)
  • 10:30 a.m.
    Towards an algorithm for deciding the two quantifier theory of the partial order of the enumeration degrees.
    Mariya I Soskova*, University of Wisconsin--Madison
    (1147-03-307)