Computability in Europe 2009
Mathematical Theory and Computational Practice
Heidelberg, Germany, 19-24 July 2009
CiE   University of Heidelberg

Computability in Europe 2009 (CiE 2009) is organised by the research group in Mathematical Logic and Theoretical Computer Science at the Department of Mathematics and Computer Science of the Ruprecht-Karls-Universität Heidelberg and takes place in Heidelberg, Germany, 19 - 24 July 2009.

CiE 2009 is the fifth conference in a newly evolving conference series under the heading Computability in Europe, which started 2005 in Amsterdam as
CiE 2005: New Computational Paradigms and has been very successfully continued in Swansea CiE 2006: Logical Approaches to Computational BarriersSiena CiE 2007: Computation and Logic in the Real Worldand Athens CiE 2008: Logic and Theory of Algorithms.

The scope of CiE 2009 encompasses theoretical and practical issues in computer science, with a focus on the interplay between these types of issues. In particular submissions are solicited that derive such interactions that relate to recent developments in mathematical theory and computational practice.


Conference topics include but are not limited to the following.
Admissible sets
Analog computation
Artificial intelligence
Automata theory
Classical computability and degree structures
Computability theoretic aspects of programs
Computable analysis and real computation
Computable structures and models
Computational and proof complexity
Computational complexity
Computational learning and complexity
Concurrency and distributed computation
Constructive mathematics
Cryptographic complexity
Decidability of theories
Derandomization
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
Natural computing
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 arithmetics and applications