Computability in Europe 2013

Milano, Italy, 01/07/2013–05/07/2013

The Nature of Computation is meant to emphasize the special focus of CiE13 on the unexpected and strong changes that studies on Nature have brought in several areas of mathematics, physics, and computer science. Starting from Alan Turing, research on Nature with a computational perspective has produced novel contributions, giving rise even to new disciplines.

The conference will address all these aspects besides the more established lines of research of Computational Complexity and the interplay between Proof Theory and Computation.

topics of interest

Two complementary research perspectives pervade the Nature of Computation theme. One is focused on the understanding of new computational paradigms inspired by the processes occurring in the biological world, while focusing on a deeper and modern understanding of the theory of computation. The other perspective is on our understanding of how computations really occur in Nature, on how we can interact with those computations, and on their applications.

CiE 2013 conference topics include, but not exclusively:

- Admissible sets
- Algorithms
- Analog computation
- Artificial intelligence
- Automata theory
- Bioinformatics
- Classical computability and degree structures
- Cognitive science and modelling
- Complexity classes
- Computability theoretic aspects of programs
- Computable analysis and real computation
- Computable structures and models
- Computational and proof complexity
- Computational biology
- Computational creativity
- Computational learning and complexity
- Computational linguistics
- 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
- Emerging and Non-standard Models of Computation
- 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
- Machine learning
- Mathematical models of emergence
- Molecular computation
- Morphogenesis and developmental biology
- Multi-agent systems
- Natural Computation
- Neural nets and connectionist models
- Philosophy of science and computation
- Physics and computability
- Probabilistic systems
- Process algebras and concurrent systems
- Programming language semantics
- Proof mining and applications
- Proof theory and computability
- Proof complexity
- Quantum computing and complexity
- Randomness
- Reducibilities and relative computation
- Relativistic computation
- Reverse mathematics
- Semantics and logic of computation
- Swarm intelligence and self-organisation
- Type systems and type theory
- Uncertain Reasoning
- Weak systems of arithmetic and applications