[Prev][Next][Index][Thread]

Feasible Mathematics Workshop



Date:         Wed, 25 Jan 89 14:32:54 EST

To: types@theory.LCS.MIT.EDU


                  FEASIBLE MATHEMATICS WORKSHOP
   Analyzing complexity of algorithms is both a practical
problem and a major area of theoretical research for computer
scientists, logicians, and mathematicians.  Since the 1960's,
there has been an increasingly sophisticated classification
of algorithms into natural classes (e.g. P, NP, P-Space, Exp-time,
etc.) leading to a deeper understanding of the limits of feasible
computation.
    More recently, researchers have begun investigating the logical
and mathematical consequences of "resource-bounded" (e.g. polynomial
time) mathematics. Active areas include:  polynomial-time logics,
bounded versions of arithmetic and lambda calculus, proof theory
of feasible systems, feasible polymorphic languages, and polynomial
time versions of algebra and analysis.  Such "feasible" mathematics
typically mixes logical techniques from proof theory and finite model
theory, as well as complexity and recursion theory, combinatorics,
and traditional mathematics.
   There will be a Workshop from June 26-28, 1989 to be held at
Cornell University, under the auspices of MSI (Anil Nerode, Director),
entitled " Feasible Mathematics".
    This workshop will gather together researchers from various
disciplines to discuss the state of the art in this area.
Researchers who are currently scheduled to speak include:  M. Ajtai,
L.Blum, S.Buss, P. Clote, J. Crossley, S. Cook, J-Y.Girard, Y. Gurevich,
K-I Ko, D. Leivant, A. Nerode, J. Remmel, A. Scedrov, P. Scott,
G. Takeuti, and A. Urquhart.

The Organizers of the conference are:

Sam Buss                     Philip J. Scott
Dept. of Math                Dept. of Math.
U.C.S.D                      University of     Ottawa
La Jolla, CA 92037           Ottawa, Ont. Canada K1N 6N5
e-mail: sbuss@cs.ucsd.edu   e-mail: scpsg@uottawa.bitnet

For further information, contact the organizers or
for local information, contact Wil Kone(NVHY@Cornellc)