[FOM] CiE06: 2nd Call for Papers

S B Cooper pmt6sbc at maths.leeds.ac.uk
Fri Nov 11 06:25:27 EST 2005


[Apologies for the inevitable multiple copies of this announcement]


                                CiE 2006
                      Computability in Europe 2006 :
               Logical Approaches to Computational Barriers
                          30 June - 5 July 2006
                           Swansea University
                    http://www.cs.swansea.ac.uk/cie06/

                         2nd  CALL  FOR  PAPERS

                        Deadline: JANUARY 6, 2006

CiE 2006 is the second of a new conference series on
Computability Theory and related topics which started in
Amsterdam in 2005.  CiE 2006 will focus on (but not be limited
to) logical approaches to computational barriers:
- practical and feasible barriers, e.g., centred around the P vs.
   NP problem;
- computable barriers connected to models of computers and
   programming languages;
- hypercomputable barriers related to physical systems.

Tutorials:
    Samuel R. Buss (San Diego, CA)
    Julia Kempe (Paris)

Invited Speakers:
    Jan Bergstra (Amsterdam)
    Luca Cardelli (Microsoft Cambridge)
    Martin Davis (New York, NY)
    John W Dawson (York, PA) (Special Address on Kurt Goedel)
    Jan Krajicek (Prague)
    Elvira Mayordomo Camara (Zaragoza)
    Istvan Nemeti (Budapest)
    Helmut Schwichtenberg (Munich)
    Andreas Weiermann (Utrecht)

Special Sessions:
    Proofs and Computation
    Computable Analysis
    Challenges in Complexity
    Foundations of Programming
    Mathematical Models of Computers and Hypercomputers
    Goedel Centenary: His Legacy for Computability

The Programme Committee cordially invites all researchers
(European and non-European) in the area of Computability Theory
to submit their papers (in PDF-format, max 10 pages) for
presentation at CiE 2006.  We particularly invite papers that
build bridges between different parts of the research community.
Since women are underrepresented in mathematics and computer
science, we emphatically encourage submissions by female authors.

The proceedings will be published within Springer's LNCS series.

To submit a paper and for more information on the submission
process, go to our web site http://www.cs.swansea.ac.uk/cie06/

Important dates:

Submission Deadline:           January 6th, 2006.
Notification of Authors:         March 3rd, 2006.
Deadline for Final Version:     March 24th, 2006.

(Please note that the dates have changed.)


Programme Committee:
    Samson Abramsky  (Oxford)
    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 Gavalda (Barcelona)
    Giuseppe Longo (Paris)
    Benedikt Loewe (Amsterdam)
    Yuri Matiyasevich (St.Petersburg)
    Dag Normann (Oslo)
    Giovanni Sambin (Padova)
    Uwe Schoening (Ulm)
    Andrea Sorbi (Siena)
    Ivan Soskov (Sofia)
    Leen Torenvliet (Amsterdam)
    John Tucker (Swansea, co-chair)
    Peter van Emde Boas (Amsterdam)
    Klaus Weihrauch (Hagen)

Sponsors:

Financial support:
    British Logic Colloquium (BLC)
    Engineering and Physical Sciences Research Council (EPSRC)
    Kurt Goedel Society (KGS)
    London Mathematical Society (LMS)
    Welsh Development Agency (WDA)

Other sponsors:
    Association for Symbolic Logic (ASL)
    European Association for Theoretical Computer Science (EATCS)
    British Computer Society (BCS)
    IT Wales

Grants:
    Some UK student grants, funded by the EPSRC, are available. A
    limited number of UK student grants and former Soviet Union
    grants, funded by the LMS, is available.  Registered students,
    who are members of the ASL, may also apply for ASL travel
    funds.

For more information on the conference series, please check the CiE
conference series http://www.illc.uva.nl/CiE/ and our web page
http://www.cs.swansea.ac.uk/cie06/.


More information about the FOM mailing list