Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Invited Talks

Tutorials and Invited Talks

We will have two Tutorial Speakers (giving 3x1h lectures each) and eight Invited Speakers and one Invited Special Address (giving 1h lectures each).


picture Samuel R Buss (San Diego, CA) Proof complexity and computational hardness
picture Julia Kempe (Paris) Quantum Algorithms

Invited Talks

picture Jan A Bergstra (Amsterdam) Elementary Algebraic Specifications of the Rational Function Field
picture Luca Cardelli (Cambridge) Biological Systems as Reactive Systems
picture Martin Davis (New York, NY) The Church-Turing Thesis: Consensus and Opposition
picture John Dawson (York, PA) Gödel and the origins of computer science
special address sponsored by the Kurt Gödel Society in Vienna
picture Jan Krajíček (Prague) Forcing with random variables and proof complexity
picture Elvira Mayordomo (Zaragoza) Two open problems on effective dimension
picture István Németi (Budapest) Can general relativistic computers break the Turing barrier? (talk cancelled)
picture Helmut Schwichtenberg (Munich) Inverting monotone continuous functions in constructive analysis
picture Andreas Weiermann (Utrecht) Phase transition thresholds for some natural subclasses of the computable functions

websites: Arnold Beckmann 2006-07-02 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by