AMS :: Fall Central Sectional Meeting, AMS Special Session

AMS Sectional Meeting AMS Special Session

Current as of Saturday, November 5, 2016 03:30:05

Associate secretaries:

Georgia Benkart, AMS benkart@math.wisc.edu

Friday October 28, 2016, 2:30 p.m.-4:50 p.m.
Special Session on Effective Mathematics in Discrete and Continuous Worlds, I
TMH 355, Terrence Murphy Hall
Organizers:
Wesley Calvert, Southern Illinois University wcalvert@siu.edu
Timothy McNicholl, Iowa State University
- 2:30 p.m.
  Cototality and the skip operator.
  Mariya I Soskova*, Sofia University
  (1123-03-41)
- 3:00 p.m.
  Bounded Turing Reductions and Data Processing Inequalities for Sequences.
  Adam Case*, Drake University
  (1123-68-94)
- 3:30 p.m.
  Decidable properties of automatic sequences.
  Narad Rampersad*, University of Winnipeg
  (1123-68-10)
- 4:00 p.m.
  Comparing Notions of Effective Genericity.
  Rose Weisshaar*, University of Notre Dame
  (1123-03-107)
- 4:30 p.m.
  The random members of a $\Pi^0_1$ class.
  Douglas Cenzer*, Department of Mathematics, University of Florida
  Christopher Porter, Department of Mathematics and Computer Science, Drake University
  (1123-03-157)

Saturday October 29, 2016, 8:30 a.m.-10:50 a.m.
Special Session on Effective Mathematics in Discrete and Continuous Worlds, II
TMH 355, Terrence Murphy Hall
Organizers:
Wesley Calvert, Southern Illinois University wcalvert@siu.edu
Timothy McNicholl, Iowa State University
- 8:30 a.m.
  Kolmogorov complexity and generalized length functions.
  Christopher P Porter*, Drake University
  Cameron Fraize, University of Florida
  (1123-03-239)
- 9:00 a.m.
  Efficient Computation of Absolutely Normal Numbers.
  Jack H. Lutz*, Iowa State University
  (1123-03-335)
- 9:30 a.m.
  Dimension 1 sequences are close to randoms.
  Noam Greenberg, Victoria University of Wellington
  Joseph S. Miller, University of Wisconsin-Madison
  Alexander Shen, LIRMM, CNRS & University of Montpellier
  Linda Brown Westrick*, University of Connecticut
  (1123-03-343)
- 10:00 a.m.
  Polynomial space randomness and analysis.
  Donald M. Stull*, Iowa State University
  (1123-03-324)
- 10:30 a.m.
  Fourier series and Schnorr randomness.
  Johanna N.Y. Franklin*, Hofstra University
  Timothy H. McNicholl, Iowa State University
  Jason Rute, Pennsylvania State University
  (1123-03-109)

Saturday October 29, 2016, 2:30 p.m.-4:20 p.m.
Special Session on Effective Mathematics in Discrete and Continuous Worlds, III
TMH 355, Terrence Murphy Hall
Organizers:
Wesley Calvert, Southern Illinois University wcalvert@siu.edu
Timothy McNicholl, Iowa State University
- 2:30 p.m.
  Computable structures of Scott rank $\omega_1^{CK}$.
  Matthew Harrison-Trainor, University of California, Berkeley
  Gregory Igusa, University of Notre Dame, Victoria University, Wellington
  Julia Knight*, University of Notre Dame
  (1123-03-65)
- 3:00 p.m.
  Khisamiev functions and algebraic structures.
  Valentina Harizanov*, George Washington University
  (1123-03-253)
- 3:30 p.m.
  Effective labelings of infinite graphs.
  Oscar Levin*, University of Northern Colorado
  (1123-03-303)
- 4:00 p.m.
  A computable structure of finite computable dimension without a strong degree of categoricity.
  Barbara Csima, University of Waterloo
  Jonathan Stephenson*, University of Waterloo
  (1123-03-320)

Sunday October 30, 2016, 9:00 a.m.-11:50 a.m.
Special Session on Effective Mathematics in Discrete and Continuous Worlds, IV
TMH 355, Terrence Murphy Hall
Organizers:
Wesley Calvert, Southern Illinois University wcalvert@siu.edu
Timothy McNicholl, Iowa State University
- 9:00 a.m.
  The structure of computably enumerable equivalence relations.
  Uri Andrews*, University of Wisconsin -- Madison
  (1123-03-364)
- 9:30 a.m.
  Effectiveness for the Dual Ramsey theorem.
  Damir Dzhafarov, University of Connecticut
  Stephen Flood, Bridgewater State University
  Reed Solomon*, University of Connecticut
  Linda Brown Westrick, University of Connecticut
  (1123-03-250)
- 10:00 a.m.
  Bounded Quantifier Strong Minimality.
  Tamvana Makuluni*, University of Wisconsin--Madison
  (1123-03-389)
- 10:30 a.m.
  A uniform reducibility in computably presented Polish spaces.
  Timothy H. Rute, Iowa State University
  Jason M. Rute*, Pennsylvania State University
  (1123-03-230)
- 11:00 a.m.
  Formal languages, topology, and some challenging computations.
  James D Currie*, The University of Winnipeg
  (1123-05-83)
- 11:30 a.m.
  Computability-theoretic methods in descriptive set theory.
  Takayuki Kihara*, Department of Mathematics, University of California, Berkeley
  (1123-03-52)