AMS Sectional Meeting Program by Special Session

Current as of Saturday, April 23, 2005 00:22:16

Associate secretaries:
Michel L Lapidus, AMS lapidus@math.ucr.edu, lapidus@mathserv.ucr.edu

Saturday April 16, 2005, 10:00 a.m.-10:50 a.m.
Special Session on Complexity of Computation and Algorithms, I
Room 2116, Girvetz Hall
Organizers:
Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
- 10:00 a.m.
  Complexity, Provability and Incompleteness.
  Cristian S. Calude*, University of Auckland
  (1007-03-23)
- 10:30 a.m.
  Ockham, Complexity, and Truth.
  Kevin T. Kelly*, Carnegie Mellon University
  (1007-68-141)

Saturday April 16, 2005, 3:00 p.m.-5:50 p.m.
Special Session on Complexity of Computation and Algorithms, II
Room 2116, Girvetz Hall
Organizers:
Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
- 3:00 p.m.
  Complexity of information extraction in logical semantics.
  Jaakko Hintikka*, Boston University
  (1007-03-62)
- 4:00 p.m.
  Average-Case Complexity Bounds for Continuous Global Optimization.
  James M. Calvin*, New Jersey Institute of Technology
  (1007-68-36)
- 4:30 p.m.
  Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights.
  Grzegorz W Wasilkowski*, Department of Computer Sience, University of Kentucky
  (1007-65-56)
- 5:00 p.m.
  More General Machine Learners Yield More Complex or Information-Poor Learned Programs.
  John Case*, CIS Dept., Univ.~of Delaware, Newark, DE
  Keh-Jian Chen, Inst.~of Info.~Science, Academica Sinica, Taipei, Taiwan
  Sanjay Jain, SOC, National University of Singapore, ROS
  Wolfgang Merkle, Math.~Institut, Universitaet Heidelberg, Heidelberg, Germany
  James Royer, Dept.~of E. E. \& CS, Syracuse University, Syracuse, NY
  (1007-03-15)
- 5:30 p.m.
  Circuit Principles and Weak Pigeonhole Variants.
  Christopher J Pollett*, San Jose State University
  Norman Danner, Wesleyan University
  (1007-68-26)

Sunday April 17, 2005, 9:00 a.m.-10:50 a.m.
Special Session on Complexity of Computation and Algorithms, III
Room 2116, Girvetz Hall
Organizers:
Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
- 9:00 a.m.
  Modeling Complexity of Living and Thinking Systems by Calculus of Iterations in Discrete Time and Space.
  Vladimir Gontar*, Ben-Gurion University of the Negev
  (1007-68-24)
- 9:30 a.m.
  Complexity of algorithms and program quality.
  Mark Burgin*, UCLA
  Narayan Debnath, Department of Computer Science, Winona State University
  (1007-68-50)
- 10:00 a.m.
  Complexity of problems and duality of measures.
  Mark Burgin*, UCLA
  (1007-68-47)
- 10:30 a.m.
  The Complexity of String Graphs.
  Marcus Schaefer*, DePaul University
  Eric Sedgwick, DePaul University
  Daniel Stefankovic, University of Chicago
  (1007-68-46)

Sunday April 17, 2005, 3:00 p.m.-4:50 p.m.
Special Session on Complexity of Computation and Algorithms, IV
Room 2116, Girvetz Hall
Organizers:
Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
- 3:30 p.m.
  On the complexity of the dynamics and structure of ramified charge transportation networks in an electromechanical system.
  Alfred W Hubler*, University of Illinois at Urbana-Champaign
  (1007-82-123)
- 4:00 p.m.
  Algorithmic complexity and inductive decidability.
  Mark Burgin*, UCLA
  Gregory J. Chaitin, IBM Research
  (1007-03-78)
- 4:30 p.m.
  Decreasing Complexity of a Universal Cellular Automaton in the Hyperbolic 3D Space.
  Maurice Margenstern**, Universit\'e de Metz, LITA, EA 3097, Ile du Saulcy, 57045 METZ C\'edex, FRANCE
  (1007-05-81)

Inquiries: meet@ams.org