We will have two Tutorial Speakers (giving 3x1h lectures each) and eight Invited Speakers and one Invited Special Address (giving 1h lectures each).
Tutorials
Samuel R Buss (San Diego, CA) 
Proof complexity and computational hardness presentation 
Julia Kempe (Paris)  Quantum Algorithms 
Invited Talks
Jan A Bergstra (Amsterdam) 
Elementary Algebraic Specifications of the Rational Function Field presentation 
Luca Cardelli (Cambridge) 
Biological Systems as Reactive Systems presentation 
Martin Davis (New York, NY)  The ChurchTuring Thesis: Consensus and Opposition 
John Dawson (York, PA) 
Gödel and the origins of computer science presentation special address sponsored by the Kurt Gödel Society in Vienna 
Jan Krajíček (Prague)  Forcing with random variables and proof complexity 
Elvira Mayordomo (Zaragoza) 
Two open problems on effective dimension presentation 

presentation 
Helmut Schwichtenberg (Munich)  Inverting monotone continuous functions in constructive analysis 
Andreas Weiermann (Utrecht)  Phase transition thresholds for some natural subclasses of the computable functions 
websites: Arnold Beckmann  20060702 