AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:21:44
2004 Fall Central Section Meeting
Evanston, IL, October 23-24, 2004
Meeting #1001
Associate secretaries: Susan J Friedlander, AMS susan@math.northwestern.edu
Special Session on Computability Theory and Applications
-
Saturday October 23, 2004, 8:30 a.m.-11:20 a.m.
Special Session on Computability Theory and Applications, I
Room G 03, Donald P. Jacobs Center
Organizers:
Robert I. Soare, University of Chicago soare@math.uchicago.edu
Denis R. Hirschfeldt, University of Chicago drh@math.uchicago.edu
-
8:30 a.m.
Degrees of nontrivial self-embeddings of computable linear orderings.
Rodney G. Downey, Victoria University of Wellington
Carl Jockusch*, University of Illinois at Urbana-Champaign
Joseph S. Miller, Victoria University of Wellington
(1001-03-44) -
9:00 a.m.
Computable structures of high rank.
W. Calvert, University of Notre Dame
S. S. Goncharov, Sobolev Institute/Novosibirsk State University
J. F. Knight*, University of Notre Dame
O. Kudinov, Sobolev Institute/Novosibirsk State University
A. S. Morozov, Sobolev Institute/Novosibirsk State University
V. Puzarenko, Sobolev Institute/Novosibirsk State University
(1001-03-69) -
9:30 a.m.
Index sets of dense Boolean algebras.
Barbara F. Csima*, Cornell University
Antonio Montalban, Cornell University
Richard A. Shore, Cornell University
(1001-03-170) -
10:00 a.m.
Ramsey Degrees.
Joseph R Mileti*, University of Chicago
(1001-03-161) -
10:30 a.m.
Undecidability in the Enumeration Degrees.
Thomas F. Kent*, University of Wisconsin, Madison
(1001-03-199) -
11:00 a.m.
Description and Comparison of Computable Structures.
Wesley Calvert*, University of Notre Dame
Valentina Harizanov, George Washington University
Julia F. Knight, University of Notre Dame
Sara Miller, University of Notre Dame
(1001-03-82)
-
8:30 a.m.
-
Saturday October 23, 2004, 3:00 p.m.-5:50 p.m.
Special Session on Computability Theory and Applications, II
Room G 03, Donald P. Jacobs Center
Organizers:
Robert I. Soare, University of Chicago soare@math.uchicago.edu
Denis R. Hirschfeldt, University of Chicago drh@math.uchicago.edu
-
3:00 p.m.
On Downey's Conjecture.
Marat M. Arslanov, Kazan State University
Iskander Sh. Kalimullin, Kazan State University
Steffen Lempp*, University of Wisconsin--Madison
(1001-03-132) -
3:30 p.m.
The initial segment complexity of random reals.
Joseph S. Miller*, Indiana University Bloomington
Liang Yu, Victoria University of Wellington
(1001-03-183) -
4:00 p.m.
Degree Spectra of Homogeneous Models.
Karen M. Lange*, University of Chicago
(1001-03-180) -
4:30 p.m.
Computability Theory and Logic Programming.
Douglas Cenzer*, University of Florida
Jeffrey Remmel, University of California at San Diego
(1001-03-138) -
5:00 p.m.
Degrees of Saturated Models.
Kenneth A. Harris*, University of Chicago
Denis R. Hirschfeldt, University of Chicago
Robert I. Soare, University of Chicago
(1001-03-205) -
5:30 p.m.
Effectively and Relatively Effectively Categorical Structures.
Valentina Harizanov*, George Washington University
(1001-03-162)
-
3:00 p.m.
-
Sunday October 24, 2004, 8:30 a.m.-11:20 a.m.
Special Session on Computability Theory and Applications, III
Room G 03, Donald P. Jacobs Center
Organizers:
Robert I. Soare, University of Chicago soare@math.uchicago.edu
Denis R. Hirschfeldt, University of Chicago drh@math.uchicago.edu
-
8:30 a.m.
The existential theory of the jump-usl of Turing degrees with least element.
Manuel Lerman*, University of Connecticut
(1001-03-62) -
9:00 a.m.
What is computability for physical systems?
Anil Nerode*, Department of Mathematics, Cornell University
(1001-03-185) -
9:30 a.m.
On Fra\"{\i}ss\'{e}'s conjecture and some equivalent statements.
Antonio Montalban*, Cornell University
(1001-03-80) -
10:00 a.m.
Mass Problems to the Rescue!
Stephen G. Simpson*, Department of Mathematics, Pennsylvania State University
(1001-03-98) -
10:30 a.m.
Invariance and degree in the lattice of $\Pi^0_1$ classes.
Rebecca Weber*, Penn State
(1001-03-92) -
11:00 a.m.
An Application of Kolmogorov Complexity to the Structure of Scott Sets.
Theodore A. Slaman*, University of California, Berkeley
(1001-03-143)
-
8:30 a.m.
-
Sunday October 24, 2004, 3:00 p.m.-5:50 p.m.
Special Session on Computability Theory and Applications, IV
Room G 03, Donald P. Jacobs Center
Organizers:
Robert I. Soare, University of Chicago soare@math.uchicago.edu
Denis R. Hirschfeldt, University of Chicago drh@math.uchicago.edu
-
3:00 p.m.
The low$_{n}$ and low$_{m}$ r.e.\ degrees are not elementarily equivalent.
Richard A. Shore*, Cornell University
(1001-03-66) -
3:30 p.m.
Minimal wtt degrees and computably enumerable Turing degrees.
Reed Solomon*, University of Connecticut
Rodney Downey, Victoria University at Wellington
(1001-03-122) -
4:00 p.m.
Improving and Proving the Slaman-Woodin Conjecture.
Peter Cholak*, University of Notre Dame
Rod Downey, Victoria University (of Wellington, New Zealand)
Leo Harrington, UC--Berkeley
(1001-03-118) -
4:30 p.m.
Spectra of relations on the random graph.
Valentina Harizanov, George Washington University
Russell Miller*, Queens College -- C.U.N.Y.
(1001-03-218) -
5:00 p.m.
Embedding and Coding Below a 1-Generic Degree.
Noam Greenberg*, University of Notre Dame
Antonio Montalban, Cornell University
(1001-03-67) -
5:30 p.m.
Computably Enumerable Algebras, Their Expansions, and Isomorphisms.
Bakhadyr Khoussainov*, The University of Auckland, New Zealand
Steffen Lempp, The University of Wisconsin-Madison
Theodore A Slaman, Berkeley
(1001-03-283)
-
3:00 p.m.