Skip to Main Content

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:10:31

Program  |  Deadlines  |  Registration/Housing/Etc.  |  Inquiries:  meet@ams.org

2003 Spring Western Section Meeting
San Francisco, CA, May 3-4, 2003
Meeting #987

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

Special Session on Beyond Classical Boundaries of Computability

  • Saturday May 3, 2003, 8:30 a.m.-10:50 a.m.
    Special Session on Beyond Classical Boundaries of Computability, I
    Room 329, Thornton Hall
    Organizers:
    Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
    Peter Wegner, Brown University pw@cs.brown.edu

    • 8:30 a.m.
      Supertask computation with infinite time Turing machines.
      Joel David Hamkins*, Georgia State University
      (987-03-09)
    • 9:00 a.m.
      Computation in Pitowsky and Malament-Hogarth Spacetimes.
      Oron Shagrir*, The Hebrew University of Jerusalem
      (987-68-20)
    • 9:30 a.m.
      Quantum Mechanical Principles and Computation.
      Tien D Kieu*, Swinburne University of Technology
      (987-81-10)
    • 10:00 a.m.
      Hypercomputation by Definition.
      Benjamin Wells*, University of San Francisco
      (987-03-14)
    • 10:30 a.m.
      Determinacy, Arithmetical quasi-inductive definitions, and Infinite Time Turing Machine Computations.
      Philip David Welch*, University of Bristol
      (987-03-141)

  • Saturday May 3, 2003, 3:00 p.m.-6:00 p.m.
    Special Session on Beyond Classical Boundaries of Computability, II
    Room 329, Thornton Hall
    Organizers:
    Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
    Peter Wegner, Brown University pw@cs.brown.edu

    • 3:00 p.m.
      Turing's Life and Ideas.
      Peter Wegner*, Brown University
      (987-68-11)
    • 3:30 p.m.
      SuperTuring Models of Computation.
      Dina Goldin*, University of Connecticut
      (987-68-12)
    • 4:00 p.m.
      Natural Computation and Non-Turing Models of Computation.
      Bruce J. MacLennan*, Department of Computer Science, The University of Tennessee, Knoxville
      (987-68-18)
    • 4:30 p.m.
      New Kind of Computer Science.
      Eugene Eberbach*, University of Massachusetts
      (987-68-13)
    • 5:00 p.m.
      Continuous-space model of computation.
      Damien Woods*, National University of Ireland, Maynooth
      Thomas J Naughton, National University of Ireland, Maynooth
      J Paul Gibson, National University of Ireland, Maynooth
      (987-68-30)
    • 5:30 p.m.
      Round Table

  • Sunday May 4, 2003, 8:00 a.m.-10:50 a.m.
    Special Session on Beyond Classical Boundaries of Computability, III
    Room 329, Thornton Hall
    Organizers:
    Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
    Peter Wegner, Brown University pw@cs.brown.edu

    • 8:00 a.m.
      On the complexity of real recursive functions.
      Manuel Lameiras Campagnolo*, Lisbon University of Technology
      (987-68-08)
    • 8:30 a.m.
      Descriptive complexity in classes of inductive Turing machines.
      Mark Burgin*, UCLA
      (987-68-06)
    • 9:00 a.m.
      If Intelligence is Uncomputable, Then...
      Peter Kugel*, Boston College
      (987-68-16)
    • 9:30 a.m.
      Learning in the limit and experience of generations.
      Mark Burgin*, UCLA
      Allen Klinger, UCLA
      (987-68-31)
    • 10:00 a.m.
      A formal model of fuzzy computations (preliminary report).
      Jiri Wiedermann*, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague
      (987-68-48)
    • 10:30 a.m.
      On Asymptotic Decidability of Some Problems Related to Artificial Intelligence.
      Marek A Suchenek*, California State University Dominguez Hills
      (987-03-100)

  • Sunday May 4, 2003, 3:00 p.m.-6:00 p.m.
    Special Session on Beyond Classical Boundaries of Computability, IV
    Room 329, Thornton Hall
    Organizers:
    Mark Burgin, University of California Los Angeles mburgin@math.ucla.edu
    Peter Wegner, Brown University pw@cs.brown.edu

    • 3:00 p.m.
      A Logical Approach to the Philosophy of Hypercomputation.
      Selmer C Bringsjord*, Rensselaer Polytechnic Institute (RPI)
      (987-03-15)
    • 3:30 p.m.
      Turing's Thesis, Hume's Problem, and Ockham's Razor: Uncertainty, Simplicity, and Efficiency in Empirical and Formal Reasoning.
      Kevin T. Kelly*, Carnegie Mellon University
      (987-03-25)
    • 4:00 p.m.
      The Concept of Computability.
      Carol E. Cleland*, Philosophy Department, University of Colorado
      (987-03-47)
    • 4:30 p.m.
      Hypercomputation in the Real World.
      B. Jack Copeland*, University of Canterbury, New Zealand
      (987-03-126)
    • 5:00 p.m.
      Attempts to Compute the Uncomputable.
      Martin D Davis*, UC Berkeley
      (987-03-93)
    • 5:30 p.m.
      Round Table
Inquiries:  meet@ams.org