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).

Tutorials

	John V. Tucker (Swansea)	Applied Computability: A European Perspective
	Moshe Y. Vardi (Houston TX)	Logic, Automata, Games, and Algorithms

Opening Lecture

Keith Devlin (Stanford CA)

The Computing Species

Invited Talks

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