Computability in Europe 2006
Logical Approaches to Computational Barriers

Special Sessions

Each special session will have four speakers, each of which will have 30 min for their talk.

Below you can find a schedule of the talks.

Special Sessions

Proofs and Computation
organised by Alessandra Carbone
and Thomas Strahm
Kai Brünnler (Bern): Deep Inference and its Normal Form of Derivations
Roy Dyckhoff (St Andrews): LJQ: A Strongly Focused Calculus for Intuitionistic Logic
Thomas Ehrhard (Marseille): Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms
Georges Gonthier (Cambridge): Using reflection to prove the Four Colour Theorem
Computable Analysis
organised by Peter Hertling
and Dirk Pattinson
Margarita Korovina (Aarhus): Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems
Paulo Oliva (London): Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
Matthias Schroeder (Edinburgh): Admissible Representations in Computable Analysis
Xizhong Zheng (Cottbus): A Computability Theory of Real Numbers
Challenges in Complexity
organised by Klaus Meer
and Jacobo Torán
Johannes Köbler (Berlin): Complexity of Graph Isomorphism for Restricted Graph Classes
Sophie Laplante (Paris): Lower bounds using Kolmogorov complexity
Johann A. Makowsky (Haifa): From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Mihai Prunescu (Freiburg): Fast quantifier elimination means P = NP
Foundations of Programming
organised by Inge Bethke
and Martín Escardó
Erika Ábrahám (Freiburg): Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
Roland Backhouse (Nottingham): Datatype-Generic Reasoning
James Leifer (Le Chesnay): Transactional atomicity in programming languages (talk cancelled)
Alban Ponse (Amsterdam): An Introduction to Program and Thread Algebra
Mathematical Models of Computers and Hypercomputers
organised by Joel D Hamkins
and Martin Ziegler
Jean-Charles Delvenne (Louvain-la-Neuve): Turing universality in dynamical systems
Benedikt Löwe (Amsterdam): Space bounds for infinitary computation
Klaus Meer (Odense): Optimization and approximation problems related to polynomial system solving
Philip Welch (Bristol): Non-deterministic halting times for Hamkins-Lewis Turing machines
Gödel Centenary:
His Legacy for Computability

organised by Matthias Baaz
and John W Dawson
Arnon Avron (Tel Aviv): From Constructibility and Absoluteness to Computability and Domain Independence
Torkel Franzén (Luleå): What does the incompleteness theorem add to the unsolvability of the halting problem? (talk cancelled) (*)
Andrew Hodges (Oxford): Gödel's remarks on Turing's work
Wilfried Sieg (Pittsburgh, PA): Gödel's Conflicting Approaches to Effective Calculability
Richard Zach (Calgary, AB): Kurt Gödel and Computability Theory
(*) Sadly, our respected colleague Torkel Franzén died on April 19th, 2006.

Schedule of Special Session Talks

Proofs and Computation
Faraday D
Foundations of Programming
Faraday B
Mathematical Models of Computers and Hypercomputers
Faraday C
July 1st, 16:00-16:30 Kai Brünnler Roland Backhouse
Jean-Charles Delvenne
July 1st, 16:30-17:00 Roy Dyckhoff
Klaus Meer
July 2nd, 10:30-11:00 Thomas Ehrhard
Alban Ponse
Benedikt Löwe
July 2nd, 11:00-11:30 Georges Gonthier Erika Ábrahám
Philip Welch
Computable Analysis
Faraday A
Challenges in Complexity
Faraday B
Gödel Centenary: His Legacy for Computability
Faraday C
July 4th, 16:00-16:30 Margarita Korovina
Sophie Laplante
Wilfried Sieg
July 4th, 16:30-17:00 Paulo Oliva
Johann A. Makowsky
Arnon Avron
July 5th, 10:30-11:00 Xizhong Zheng Johannes Köbler
Andrew Hodges
July 5th, 11:00-11:30 Matthias Schroeder
Mihai Prunescu
Richard Zach

Room Caption

The lecture rooms Faraday A-D can be found on the 1st floor of the Faraday tower, building 8.2 on campus map.
websites: Arnold Beckmann 2006-07-10