[PT] CiE 2008 - 1st Call for Papers

[Apologies for multiple copies]

******************************************************************
FIRST ANNOUNCEMENT AND CALL FOR PAPERS

                                CiE 2008
                     http://www.cs.swan.ac.uk/cie08/

     Computability in Europe 2008: Logic and Theory of Algorithms

                          University of Athens
                         Athens, June 15-20 2008

This is the fourth in a series of conferences organised by CiE=20
(Computability in Europe), a European network of mathematicians,=20
logicians, computer scientists, philosophers, physicists and=20
others interested in new developments in computability and their=20
underlying significance for the real world. Previous meetings=20
took place in Amsterdam (2005), Swansea (2006) and Siena (2007).

CiE 2008 aims at bridging the gap from the logical methods of=20
mathematical and meta-mathematical flavour to the applied and=20
industrial questions that are involved in devising and choosing=20
the right algorithms and analysing their effectiveness and=20
efficiency.

IMPORTANT DATES:
Submission of papers: January 4, 2008
Notification of authors: February 15, 2008
Final revisions:  March 7, 2008

TUTORIALS will be given by:
John V. Tucker (Swansea)
Moshe Y. Vardi (Houston, TX)

PLENARY SPEAKERS will include:
Keith Devlin (Stanford, CA)
Rosalie Iemhoff (Utrecht)
Antonina Kolokolova (Vancouver, BC)
Janos Makowsky (Haifa)
Dag Normann (Oslo)
Prakash Panangaden (Montreal, QC)
Christos Papadimitriou (Berkeley, CA)

SPECIAL SESSIONS=20
Algorithms in the history of mathematics
Formalising mathematics and extracting algorithms from proofs
Higher type recursion theory and applications
Algorithmic game theory=20
Quantum algorithms and complexity
Biology and computation

CiE 2008 conference topics include, but not exclusively

     * Admissible sets
     * Analog computation
     * Artificial intelligence
     * Automata theory
     * Classical computability and degree structures
     * Complexity classes
     * Computability theoretic aspects of programs
     * Computable analysis and real computation
     * Computable structures and models
     * Computational and proof complexity
     * Computational learning and complexity
     * Concurrency and distributed computation
     * Constructive mathematics
     * Cryptographic complexity
     * Decidability of theories
     * Derandomization
     * DNA computing
     * Domain theory and computability
     * Dynamical systems and computational models
     * Effective descriptive set theory
     * Finite model theory
     * Formal aspects of program analysis
     * Formal methods
     * Foundations of computer science
     * Games
     * Generalized recursion theory
     * History of computation
     * Hybrid systems
     * Higher type computability
     * Hypercomputational models
     * Infinite time Turing machines
     * Kolmogorov complexity
     * Lambda and combinatory calculi
     * L-systems and membrane computation
     * Mathematical models of emergence
     * Molecular computation
     * Neural nets and connectionist models
     * Philosophy of science and computation
     * Physics and computability
     * Probabilistic systems
     * Process algebra
     * Programming language semantics
     * Proof mining
     * Proof theory and computability
     * Quantum computing and complexity
     * Randomness
     * Reducibilities and relative computation
     * Relativistic computation
     * Reverse mathematics
     * Swarm intelligence
     * Type systems  and type theory
     * Uncertain reasoning
     * Weak systems of arithmetic and applications

Contributed papers will be selected from submissions received by=20
the PROGRAMME COMMITTEE consisting of:

L. Aiello (Roma)=09       =09T. Altenkirch (Nottingham)
K. Ambos-Spies (Heidelberg) =09G. Ausiello (Roma)
A. Beckmann (Swansea, co-chair) L. Beklemishev (Moscow)
P. Bonizzoni (Milano)=09=09S. A. Cook (Toronto ON)
B. Cooper (Leeds)=09=09C. Dimitracopoulos (Athens, co-chair)
R. Downey (Wellington)=09=09E. Koutsoupias (Athens)
O. Kupferman (Jerusalem) =09S. Laplante (Orsay)
H. Leitgeb (Bristol)=09=09B. L=C3=B6we (Amsterdam)
E. Mayordomo C=C3=A1mara (Zaragoza) =09F. Montagna (Siena)
M. Mytilinaios (Athens) =E2=80=A0 =09M. Nielsen (Aarhus)
I. Oitavem (Lisboa)=09=09C. Palamidessi (Palaiseau)
T. Pheidas (Heraklion)=09=09Ramanujam (Chennai)
A. Schalk (Manchester)=09=09U. Sch=C3=B6ning (Ulm)
H. Schwichtenberg (M=C3=BCnchen) =09A. Selman (Buffalo NY)
A. Sorbi (Siena)=09=09I. Soskov (Sofia)
C. Timpson (Leeds)=09=09S. Zachos (New York NY)

We cordially invite all researchers (European and non-European)=20
in computability related areas to submit their papers (in PDF-=20
format, max 10 pages) for presentation at CiE 2008. We=20
particularly invite papers that build bridges between different=20
parts of the research community.

The CONFERENCE PROCEEDINGS will be published by LNCS,=20
Springer-Verlag. There will also be journal special issues,=20
collecting invited contributions related to the conference.