Departmental Seminars
This is a patchy historical record of seminars that have taken place in the Department from 19962002. From 2003 the departmental seminar series was integrated into the colloquium series and group seminars.
20012002

Tuesday 11th September 2001, 14:00, Board Room
Jens Blanck (Swansea University)
On exact real arithmetic

Tuesday 18th September 2001, 14:00, Robert Recorde Room
Oliver Kullmann (Swansea University)
Generalized satisfiability problems

Thursday 27th September 2001, 14:00, Robert Recorde Room
Anton Setzer (Swansea University)
Interactive Programs in Dependent Type Theory

Tuesday 2nd October 2001, 14:00, Robert Recorde Room
Anton Setzer (Swansea University)
Interactive Programs in Dependent Type Theory (Cont.)

Thursday 18th October 2001, 14:00, Board Room
J. Roger Hindley (Swansea University)
The early days of combinators and lambda calculus

Tuesday 30th October 2001, 14:00, Robert Recorde Room
Peter G. Hinman (University of Michigan, visiting Swansea)
Density of Medvedev degrees of Pi^0_1classes

Tuesday 11th December 2001, 14:00, Board Room
Paulo Oliva (BRICS, Ã…rhus, visiting Swansea)
On the relation between modified bar recursion and other bar recursive definitions

Thursday 7th March 2002, 14:00, Robert Recorde Room
Faron Moller (Swansea University)
Lower bounds for equivalence checking onecounter automata

Tuesday 12th March 2002, 14:00, Robert Recorde Room
Oliver Kullmann (Swansea University)
Phase transitions and thresholds, the Advanced Encryption Standard (AES), databases for combinatorial problems, and heuristics for SAT solvers

Tuesday 19th March 2002, 14:00, Robert Recorde Room
Oliver Kullmann (Swansea University)
Phase transitions and thresholds, the Advanced Encryption Standard (AES), databases for combinatorial problems, and heuristics for SAT solvers (II)

Thursday 21st March 2002, 14:00, Robert Recorde Room
Oliver Kullmann (Swansea University)
Phase transitions and thresholds, the Advanced Encryption Standard (AES), databases for combinatorial problems, and heuristics for SAT solvers (III)

Tuesday 26th March 2002, 14:00, Robert Recorde Room
Ulrich Berger (Swansea University)
Whileprograms are Turingincomplete for nonstrict oracles

Thursday 16th May 2002, 14:00, Robert Recorde Room
Neal Harman (Swansea University)
Correctness and Verification of Microprocessors

Thursday 11th July 2002, 14:00, Robert Recorde Room
Ulrich Berger (Swansea University)
A domaintheoretic realization of the classical axiom of countable choice