Here are some of my recent talks

  • Talk at Berkeley about least jump enumerations
  • Queensland University paramaterized complexity based around coding theory
  • Plenary lecture at Vienna on algorithmic randomness (Logic Colloquium)
  • Talk at CDMTCS, Auckland on presentations of reals
  • Invited seminar, Massey University, Palmerston randomness and triviality
  • Plenary talk at UCSD on Pi-0-1 classes for ASL annual meeting
  • Invited talk at special session AMS meeting in San Diego
  • Keynote talk at Asian Logic Meeting, Chongqing (Algorithmic Randomness and Computability)
  • Nonapproximability and the minimob, invited lecture at Auckland Computer Science, 2002
  • history.doc
  • Parameterized complexity for the skeptic, plenary lecture at IEEE Annual Conference on Computational Complexity (Aarhus)
  • Algorithmic randomness, invited seminar at the University of Notre Dame
  • Presenting reals, plenary lecture at CCA, Cincinatti
  • Algoritmic randomness 2004, plenary lecture at the first joint meeting of the NZMS and Israel Math society, VIC 2004
  • Algorithmic randomness, Auckland 2004
  • Recent progress in parametric complexity, Plenary lecture, Developments in Language Theory, Auckland 2004
  • Algorithmic Randomness, UCLA Lecture for the opening of their Logic Centre
  • Collatz Functions and Conway Games, Colloquium/seminar, Auckland University, 2005
  • Effective presentations of Ideals in Computable Rings, Auckland University seminar, 2006
  • Some new natural definable degrees, Plenary lecture,Theory and Applications of Models of Computation, Beijing, 2006
  • Notes for Singapore Lectures at Nanyang for Gifted Undergraduates and Junior College Students
  • First Lecture in Logic Colloquium 2006(Randomness)
  • Second Lecture in Logic Colloquium 2006(Randomness)
  • Third Lecture in Logic Colloquium 2006 (Decanter)
  • First Lecture in Singapore IMA Series(Randomness)
  • Second Lecture in Singapore IMA Series
  • Third Lecture in Singapore IMA Series
  • Fourth Lecture in Singapore IMA Series
  • Fifth Lecture in Singapore IMA Series
  • Talk for International Congress of Mathematicians (Randomness)
  • Gainesville Lecture for CCA 2006 (Decanter and traceability)
  • Lecture at University of Florida on Ideals in Computable Rings
  • Colloquium Lecture to a general audience (Auckland University) on computability, complexity and history.
  • Colloquium Lecture to a general audience (Queensland University) on computability, complexity and history.
  • Talk at National University of Singapore, 2007, Strong Jump Traceability and Variations.
  • Talk at Nanyang University(2007), Basic Parameterized Complexity I; Introduction and completeness.
  • Talk at Nangany University(2007), Basic Parameterized Complexity II: Positive techniques and speculations.
  • Plenary Lecture, First Joint Meeting of the AMS and NZMS, Practical FPT and Foundations of Kernelization.
  • Talk at Wellington Town Hall, March 2009, randomness.
  • More on Dimensions-Madison May 2009
  • Solovay Functions, Triviality and Tracing- Asian Logic Conference, Singapore June 2009