AMS Sectional Meeting AMS Special Session
Current as of Saturday, May 4, 2013 00:21:20
Special Event or Lecture · Inquiries: meet@ams.org
Spring Central Sectional Meeting
Iowa State University, Ames, IA
April 26-28, 2013 (Friday - Sunday)
Meeting #1090
Associate secretaries:
Georgia M. Benkart, AMS benkart@math.wisc.edu
Special Session on Computability and Complexity in Discrete and Continuous Worlds
-
Saturday April 27, 2013, 8:00 a.m.-10:50 a.m.
Special Session on Computability and Complexity in Discrete and Continuous Worlds, I
Room 290, Carver
Organizers:
Jack Lutz, Iowa State University
Tim McNicholl, Iowa State University mcnichol@iastate.edu
-
8:00 a.m.
Computability in Topology and Analysis: On extendibility of functions and series of computable functions and their convergence to computable functions.
Iraj Kalantari*, Western Illinois University
(1090-03-255) -
8:30 a.m.
Complexity dichotomy theorems for counting problems.
Jin-Yi Cai*, University of Wisconsin-Madison
(1090-68-375) -
9:00 a.m.
A Thirty Year Old Conjecture about Promise Problems.
Andrew Hughes, University at Buffalo
A Pavan*, Iowa State University
Nathan Russell, University at Buffalo
Alan Selman, University at Buffalo
(1090-68-382) -
9:30 a.m.
Effectively closed sets and symbolic dynamics.
Douglas Cenzer*, Department of Mathematics, University of Florida
Sebastian Wyman, University of Florida
(1090-03-206) -
10:00 a.m.
Mutual Dimension.
Adam Case*, Iowa State University
Jack H. Lutz, Iowa State University
(1090-68-345) -
10:30 a.m.
The complexity of Grid Coloring.
Daniel Apon, University of Maryland at College Park, Dept of Computer Science
William Gasarch*, Univerisity of Maryland at College Park, University of Maryland
Kevin Lawler, Permanent, Berkely CA
(1090-05-293)
-
8:00 a.m.
-
Saturday April 27, 2013, 2:45 p.m.-5:35 p.m.
Special Session on Computability and Complexity in Discrete and Continuous Worlds, II
Room 290, Carver
Organizers:
Jack Lutz, Iowa State University
Tim McNicholl, Iowa State University mcnichol@iastate.edu
-
2:45 p.m.
Notions of computability theoretic reduction between $\Pi^1_2$ principles.
Denis R. Hirschfeldt*, University of Chicago
Carl G. Jockusch, Jr., University of Illinois at Urbana-Champaign
(1090-03-225) -
3:15 p.m.
Strengthening the Link between Complexity Classes and Kolmogorov Complexity.
Eric Allender*, Rutgers University
(1090-68-370) -
3:45 p.m.
Complexity of orders on residually nilpotent groups.
Valentina Harizanov*, The George Washington University
(1090-03-275) -
4:15 p.m.
Uniformly Computable Reductions Between Mathematical Theorems.
François G. Dorais, Dartmouth College
Damir D. Dzhafarov, University of California, Berkeley
Jeffry L. Hirst, Appalachian State University
Joseph R. Mileti*, Grinnell College
Paul Shafer, LIAFA Université Paris Diderot - Paris 7, Case 7014
(1090-03-347) -
4:45 p.m.
What does randomness mean for betting strategies?
Sam Buss, UC San Diego
Mia Minnes*, UC San Diego
(1090-03-28) -
5:15 p.m.
Schnorr randomness and the Lebesgue Differentiation Theorem.
Noopur J Pathak*, The Pennsylvania State University
Cristobal Rojas, Universidad Andres Bello
Stephen Simpson, The Pennsylvania State University
(1090-03-108)
-
2:45 p.m.
-
Sunday April 28, 2013, 8:00 a.m.-10:50 a.m.
Special Session on Computability and Complexity in Discrete and Continuous Worlds, III
Room 290, Carver
Organizers:
Jack Lutz, Iowa State University
Tim McNicholl, Iowa State University mcnichol@iastate.edu
-
8:00 a.m.
Combining basis theorems.
Stephen G. Simpson*, Pennsylvania State University
(1090-03-56) -
8:30 a.m.
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information.
Nicholas Mattei, NICTA and University of New South Wales
Judy Goldsmith*, Dept of Computer Science, University of Kentucky
Andrew Klapper, Dept of Computer Science, University of Kentucky
Martin Mundhenk, Institute of Computer Science Friedrich-Schiller-Universität Jena
(1090-68-385) -
9:00 a.m.
Polynomial-Time Randomness and Differentiability.
John M. Hitchcock*, University of Wyoming
Joshua C. Sanderlin, University of Wyoming
(1090-68-414) -
9:30 a.m.
On the Computable Curves.
Xizhong Zheng*, Arcadia University
(1090-03-149) -
10:00 a.m.
Complexity and Symmetry.
Lek-Heng Lim*, University of Chicago
Ke Ye, University of Chicago
(1090-15-267) -
10:30 a.m.
Strong separations and Kolmogorov complexity.
W.M. Phillip Hudelson*, Pennsylvania State University
(1090-03-91)
-
8:00 a.m.
-
Sunday April 28, 2013, 2:30 p.m.-4:20 p.m.
Special Session on Computability and Complexity in Discrete and Continuous Worlds, IV
Room 290, Carver
Organizers:
Jack Lutz, Iowa State University
Tim McNicholl, Iowa State University mcnichol@iastate.edu
-
2:30 p.m.
Diagonally noncomputable functions and bi-immunity.
Carl G. Jockusch*, University of Illinois at Urbana-Champaign
Andrew E. M. Lewis, University of Leeds
(1090-03-156) -
3:00 p.m.
On the Space Complexity of the Graph Reachability Problem.
Vinodchandran N Variyam*, University of Nebraska-Lincoln
(1090-68-394) -
3:30 p.m.
Strongly minimal theories with computable models.
Uri Andrews, University of Wisconsin-Madison
Julia F. Knight*, University of Notre Dame
(1090-03-88) -
4:00 p.m.
Effective dimension in general metric spaces.
Elvira Mayordomo*, Universidad de Zaragoza, Spain
(1090-68-171)
-
2:30 p.m.
Inquiries: meet@ams.org