Computability in Europe 2009
Mathematical Theory and Computational Practice
Heidelberg, Germany, 19-24 July 2009
CiE   University of Heidelberg

Opening Lecture

Mike Edmunds: The Antikythera Mechanism

Tutorials

Luca Trevisan: Advanced Methods in Randomization [PDF]

Pavel Pudlák: Proof Complexity Part 1 [PDF], Part 2 [PDF]


Plenary Talks

Manindra Agrawal: The Isomorphism Conjecture

Jeremy Avigad: Computability in Ergodic Theory

Peter Koepke: Ordinal Computability

Phokion G. Kolaitis: Foundations and Applications of Schema Mappings

Andrea Sorbi: Computing Using Positive Information

Rafael Sorkin: Logic : the Quantum :: Geometry : Gravity

Vijay V. Vazirani: Combinatorial Algorithms for Convex Programs Capturing Market Equilibira and Nash Bargaining Solutions