Computability in Europe 2008
Logic and Theory of Algorithms

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 John V. Tucker (Swansea) Applied Computability: A European Perspective
picture Moshe Y. Vardi (Houston TX) Logic, Automata, Games, and Algorithms

Opening Lecture

picture Keith Devlin (Stanford CA) The Computing Species

Invited Talks

picture Rosalie Iemhoff (Utrecht) Proof systems for admissibility
picture Antonina Kolokolova (St. John's NL) Many facets of complexity in logic
picture Johann Makowsky (Haifa) Uniform algebraic reducibilities between parameterized numeric graph invariants
picture Dag Normann (Oslo) 50 years of continuous functionals
picture Prakash Panangaden (Montréal QC) Domain theory and the causal structure of space-time
picture Christos Papadimitriou (Berkeley CA) On Nash, Brouwer, and other non-constructive proofs
picture Jiří Wiedermann (Prague)
picture and Jan van Leeuwen (Utrecht) How We Think of Computing Today

websites: Arnold Beckmann 2008-04-01