[ The Types Forum (announcements only), 
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Due to the high level of requests, we have extended the paper submission
deadline to January 14th, 2008:


    Computability in Europe 2008: Logic and Theory of Algorithms
                  University of Athens, June 15-20 2008


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

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer-Verlag.

There will also be journal special issues, collecting invited 
contributions related to the conference.  Special issues will be 
published in the journals "Theory of Computing Systems", the 
"Archive for Mathematical Logic", and the "Journal of Algorithms". 
for more informations on publications.

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


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


Reply via email to