
Conference themes:
Computability has played a crucial role in mathematics and computer science, leading to the discovery, understanding and classification of decidable/undecidable problems, paving the way to the modern computer era, and affecting deeply our view of the world. Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and
challenge assumptions about the socalled Turing barrier.
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.
Conference Topics: These 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
 Lsystems 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
 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.

