**********************************************************************
PRELIMINARY ANNOUNCEMENT

                                CiE 2007
               http://www.mat.unisi.it/newsito/cie07.html

   Computability in Europe 2007: Computation and Logic in the Real World

      Department of Mathematics and Computer Science "Roberto Magari"
                          University of Siena
                         Siena, 18-23 June 2007

IMPORTANT DATES:

Submission of papers: Jan. 12, 2007
Notification of authors: Feb. 16, 2007
Deadline for final revisions: Mar. 9, 2007

The Third Conference CiE 2007, organised by CiE (Computability in
Europe) will take place at the University of Siena, June 18-23 2007.

CiE is a European network of mathematicians, logicians, computer scientists, 
philosophers, theoretical physicists and others interested in new developments 
in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of  the  ways  computability  and
theoretical computer science enable scientists and philosophers to deal
with mathematical and  real  world  issues,  ranging  through  problems
related to logic, mathematics, physical processes, real computation and
learning theory. At the same time it will focus on  different  ways  in
which  computability  emerges from the real world, and how this affects
our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity 
in Analysis) Conference (Siena, College Santa Chiara, June 16-18, 2007):

                      http://cca-net.de/cca2007/

CiE 2007 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

We particularly welcome submissions in emergent areas, such as bioinformatics 
and natural computation, where they have a basic connection with computability.

Contributed papers will be selected from submissions  received  by  the
PROGRAM COMMITTEE consisting of:

M. Agrawal (Kanpur)              M. Arslanov (Kazan)
G. Ausiello (Roma)               A. Bauer (Ljubljana)
A. Beckmann (Swansea)            U. Berger (Swansea)
A. Cantini (Firenze)             B. Cooper (Leeds, co-chair)
L. Crosilla (Firenze)            J. Diaz (Barcelona)
C. Dimitracopoulos (Athens)      F. Ferreira (Lisbon)
S. Goncharov (Novosibirsk)       P. Gruenwald (Amsterdam)
D. Harel (Rehovot)               A. Hodges (Oxford)
J. Kempe (Paris)                 G. Longo (Paris)
B. Loewe (Amsterdam)             J. Makowsky (Haifa)
E. Mayordomo (Zaragoza)          W. Merkle (Heidelberg)
F. Montagna (Siena)              D. Normann (Oslo)
T. Pheidas (Heraklion)           G. Rozenberg (Leiden)
G. Sambin (Padova)               H. Schwichtenberg (Muenchen)
W. Sieg (Carnegie Mellon)        A. Sorbi (Siena, co-chair)
I. Soskov (Sofia)                P. van Emde Boas (Amsterdam).

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

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

The conference is sponsored by EATCS, ASL, EACSL, and AILA (Italian Association 
of Logic and Applications).

**********************************************************************