Computability theory and complexity theory have their origins in logic. Famous names such as Gödel, Turing, Cook, and Kolmogorov connect these areas of computer science to foundations of mathematics. The fundamental goal of this area is to understand the limits of computability (that is analysing which problems can be solved on nowadays and future computers in principle) and effective computability (that is understanding the class of problems which can be solved quickly and with restricted resources) where the most famous open problem is the P = NP-problem, listed on top of the collection of seven Clay Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the structure of limit of computation.
 
In our workshop, we shall focus on the following aspects: logical descriptions of complexity (e.g., descriptive complexity, bounded arithmetic), complexity classes of abstract, algebraic and infinite structures, barriers in proving complexity results, and Kolmogorov complexity and randomness. Descriptive complexity and bounded arithmetic are two complementary approaches to describe computational complexity in logical terms. The former is focussed on decision problems, while the latter is more concerned with search problems. Both environments render questions about complexity classes in a natural way, leading to important open problems in their areas (e.g. finding logics to capture certain complexity classes, or the separation problem for bounded arithmetic.)
 
 
February 17 - 20, 2010
 
 
Conference programme
^{(PDF file)}
 
Conference chair:
Dr. Christine Gaßner (University of Greifswald)
 
Chair of the Programme Committee:
Dr. Arnold Beckmann (University of Swansea)
 
Information:
tagungsbuero(at)wiko-greifswald.de
http://www.cs.swan.ac.uk/greifswald2010/
 
Conference fee:
120,- EUR (early registration, until January 15)
150,- EUR (late registration)
 
 
The registration for this conference is already closed.