seminar

2011

• Dr Hannes Diener, University of Siegen, Germany
  Constructive Reverse Mathematics
  Tuesday, 16 August 2011, 16h00, M 111 (Seminar Room)
  

• Charlotte Kestner, University of Leeds, UK
  Measurability in Modules
  Thursday, 28 April 2011, 16h00, M 214
  

2010

• Prof Conrado Martínez, Universitat Politècnica de Catalunya, Barcelona, Spain
  Searching with Dice
  Thursday, 29 July 2010, 14h00, M 111 (Seminar Room)
  

• Dr Sasha Rubin, Research Visitor, UCT
  What are automatic structures?
  Thursday, 13 May 2010, 16h00, M 111 (Seminar Room)
  

• Christian Geist, University of Amsterdam, The Netherlands
  Computer-Aided Proofs for Impossibility Theorems in Social Choice Theory
  Thursday, 16 February 2010, 16h00, M 207
  

• Dr Stéphane Le Roux, Ecole Polytechnique, Palaiseau, France
  Sequential Game Theory: A Formal and Abstract Approach
  Thursday, 4 February 2010, 16h00, M 111 (Seminar Room)
  

2009

• Thomas Birch, University of Cape Town
  Algorithmic Randomness on Metric Spaces and the Random Core Operation
  Tuesday, 8 December 2009, 14h00, M 111 (Seminar Room)
  

• Prof Benedikt Löwe, University of Amsterdam, The Netherlands
  Reduction Functions as Strategies in Infinite Games
  Tuesday, 1 December 2009, 14h00, M 111 (Seminar Room)
  

• Pavol Safarik, University of Darmstadt, Germany
  On the Computational Content of Bolzano-Weierstraß
  Thursday, 26 November 2009, 14h00, M 111 (Seminar Room)
  

• Safari Mukeru, University of South Africa, Pretoria
  Some Recent Results on Sets of Multiplicity via Brownian Motion
  Tuesday, 24 November 2009, 14h00, M 111 (Seminar Room)
  

• Prof Eric Allender, Rutgers University, USA
  On the Complexity of Numerical Analysis
  Thursday, 5 November 2009, 16h00, M 111 (Seminar Room)
  

• Prof Dieter Spreen, University of Siegen, Germany
  Effective Inseparability in a Topological Setting
  Wednesday 7 October 2009, 15h00, M 111 (Seminar Room)
  

• Arno Pauly, University of Cambridge, UK
  How Discontinuous is Computing Nash Equilibria?
  Wednesday 30 September 2009, 16h00, M 111 (Seminar Room)
  

• Prof André Nies, University of Auckland, New Zealand
  Randomness and Complexity
  Thursday 17 September 2009, 13h00, M 320 (Colloquium)
  

• Dr Alexander Ferrein, Robotics and Agents Research Laboratory, Duncan MacMillan Lab, UCT
  Readylog - A Logic-based Agent Programming Language for Autonomous Robots
  Thursday 21 May 2009, 16h00, M 111 (Seminar Room)
  

• Dr Guido Gherardi, University Bologna, Italy
  Alan Turing and the Foundations of Computable Analysis
  Friday 24 April 2009, 16h00, M 111 (Seminar Room)
  

• Prof Klaus Keimel, University of Darmstadt, Germany
  Semantics for Languages Combining Probability and Nondeterminism
  Thursday 5 March 2009, 16h00, M 111 (Seminar Room)
  

• Prof Ross Pinsky, Technion-Israel Institute of Technology, Haifa, Israel
  Card Shuffles, Random Walks on Groups and Increasing Subsequences in Random Permutations
  Thursday 26 February 2009, 16h00, M 111 (Seminar Room)
  

2008

• Prof Dieter Spreen, University of Siegen, Germany
  An Intrinsic Characterization of Effective Topologies
  Thursday 4 December 2008, 16h00, M 111 (Seminar Room)
  

• Prof Klaus Weihrauch, University of Hagen, Germany
  On the Definition of Computability in Analysis
  Thursday 13 November 2008, 16h00, M 111 (Seminar Room)
  

• Prof Valentin Goranko, University of the Witwatersrand, Johannesburg
  Symbolic Verification in Presburger-Definable Infinite-State Transition Systems
  Thursday 6 November 2008, 16h00, M 111 (Seminar Room)
  

• PD Dr Norbert Müller, University of Trier, Germany
  Jordan Areas and Grids
  Thursday 25 September 2008, 16h00, M 111 (Seminar Room)
  

• Gareth Boxall, University of Leeds, UK
  Notions of Independence in Model Theory
  Thursday 14 August 2008, 16h00, M 111 (Seminar Room)
  

• Volker Bosserhoff, University of the Armed Forces, Munich, Germany
  On Computable Bases in Banach Spaces
  Thursday 22 May 2008, 16h00, M 111 (Seminar Room)
  

• Dr Guido Gherardi, University Bologna, Italy
  Incomputability and Ontological Weight: Reverse Mathematics and Computable Analysis (Finally) Meet
  Thursday 10 April 2008, 16h00, M 111 (Seminar Room)
  

• Prof Clemens Heuberger, University of Graz, Austria
  Hamming Weight of the Non-Adjacent-Form under Various Input Statistics
  Thursday 13 March 2008, 14h00, M 111 (Seminar Room)
  

• Dr Stephan Wagner, University of Stellenbosch
  Enumeration Problems for Classes of Self-Similar Graphs
  Friday 22 February 2008, 14h00, M 111 (Seminar Room)
  

• Prof Conrado Martínez, Universitat Politècnica de Catalunya, Barcelona, Spain
  Probabilistic Analysis of Algorithms: What's It Good For?
  Tuesday 12 February 2008, 14h00, M 111 (Seminar Room)
  

2007

• Dr Holger Spakowski, University of Cape Town
  An Improved Exact Algorithm for the Domatic Number Problem
  Thursday 29 November 2007, 14h00, M 111 (Seminar Room)
  

• Prof Jeffery Zucker, McMaster University, Hamilton, Canada
  Talks on Analog Computation
  Wednesday 30 May 2007, 16h00, M 111 (Seminar Room)
  Thursday 31 May 2007, 13h00, M 111 (Seminar Room)
  

• Dr Peter Schuster, University of Munich, Germany
  Problems as Solutions
  Monday 19 March 2007, 15h00, M 111 (Seminar Room)
  

2006

• Prof Valentin Goranko, University of the Witwatersrand, Johannesburg
  Logic and Computation in Finitely Presentable Infinite Structures
  Thursday 30 November 2006, 14h00, M 111 (Seminar Room)
  

• Dr Paul Taylor, University of Manchester, UK
  Seminar Series on Abstract Stone Duality (ASD)
  Thursdays 5-19 October 2006, 14h00, M 111 (Seminar Room)
  

• Guido Gherardi, University of Siena, Italy,
  Effective Borel Degrees of Some Topological Functions
  Thursday 8 June 2006, 14h00, M 111 (Seminar Room)
  

• Prof Vasco Brattka, University of Cape Town,
  Plottable Real Number Functions and the Computable Graph Theorem
  Friday 21 April 2006, 16h00, Great Westerford Building, Newlands
  

• Prof Stephen Harnish, Visiting Researcher and Bluffton University, Ohio, USA,
  Bisimulations and Pictures of Sets: A survey of hyperset theories, their key modeling tools, and applications to computer science
  Wednesday 5 April 2006, 15h30, M 111 (Seminar Room)
  

• Prof Dieter Spreen, University of Siegen, Germany,
  On Effectivity and Continuity of Multifunctions
  Friday 24 March 2006, 15h00, M 111 (Seminar Room)
  

2005

• Prof Cristian S. Calude, University of Auckland, New Zealand,
  Complexity, Provability and Incompleteness
  Monday 28 November 2005, 11h00, M 320
  

• Prof Atsushi Yoshikawa, Kyushu University, Japan,
  An Exotic Example of a Self-Adjoint Partial Differential Operator
  Monday 21 November 2005, 10h00, Room M 200
  

• Prof Petrus H. Potgieter, University of South Africa, Pretoria,
  "Hypercomputing" Zeno machines
  Tuesday 13 September 2005, 16h00, M 111 (Seminar Room)
  

• Prof Ingrid Rewitzky, University of Stellenbosch,
  Duality via Truth
  Tuesday 24 May 2005, 16h00, M 111 (Seminar Room)

© 2005-2010 Vasco Brattka