Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

CiE 2008

CiE 2008

Computability in Europe 2008 (CiE 2008), organised by the Graduate Program in Logic, Algorithms and Computation (MPLA) and the Department of History and Philosophy of Science of the University of Athens, takes place in Athens, Greece, 15 June - 20 June, 2008. CiE08 poster CiE 2008 is the fourth of a newly evolving series of conferences under the heading Computability in Europe which started 2005 in Amsterdam as CiE 2005: New computational paradigms, and has been continued in Swansea CiE 2006: Logical approaches to computational barriers, and Siena CiE 2007: Computation and Logic in the Real World.

The conference serves as an interdisciplinary forum, which deals with approaches to practical computational problems in many different areas. This includes

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
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
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 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
Proof complexity
Quantum computing and complexity
Reducibilities and relative computation
Relativistic computation
Reverse mathematics
Swarm intelligence
Type systems and type theory
Uncertain Reasoning
Weak systems of arithmetic and applications

websites: Arnold Beckmann 2008-07-13 Valid HTML 4.01! Valid CSS!