CiE-CS: CiE 2006
Computability in Europe
CiE 2006: Logical approaches to computational barriers.
Swansea, Wales, June 30 - July 5, 2006.
Organizers: A. Beckmann (Chair), U. Berger, B. Cooper, P. Grant, O. Kullmann, B. Löwe, M. Seisenberger, A. Setzer, J. Tucker
Programme Committee:Klaus Ambos-Spies (Heidelberg), Arnold Beckmann (Swansea, co-chair), Ulrich Berger (Swansea), Olivier Bournez (Nancy), Barry Cooper (Leeds), Laura Crosilla (Firenze), Costas Dimitracopoulos (Athens), Abbas Edalat (London), Fernando Ferreira (Lisbon), Ricard Gavaldà (Barcelona), Giuseppe Longo (Paris), Benedikt Löwe (Amsterdam), Yuri Matiyasevich (St.Petersburg), Dag Normann (Oslo), Giovanni Sambin (Padova), Uwe Schöning (Ulm), Andrea Sorbi (Siena), Ivan Soskov (Sofia), Leen Torenvliet (Amsterdam), John Tucker (Swansea, co-chair), Peter van Emde Boas (Amsterdam), Klaus Weihrauch (Hagen),
In computability many fascinating barriers have been identified. They can be classified into three kinds: the practical and feasible barriers, centred around the P vs. NP problem; the computable barriers connected to models of computers and programming languages; and hypercomputable barriers which lie beyond. These three kinds of barriers can be found in all areas of computability theory: in classical computability theory on discrete data; in computations with continuous data like higher types, real numbers or topological spaces; and in the physical sciences where we find for example quantum computers, analogue computers, and other computing systems based on classical, relativistic and quantum mechanics.
Logic provides rigorous formal methods for approaching these barriers. The variety of logical methods ranges from the classical areas of mathematical logic to the newly developed areas in theoretical computer science.
Swansea is an ideal place for hosting such a conference. Its Department of Computer Science contains a unique group of logicians working on many computational barriers.