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
  • When does a problem have a solution: a logician's and computability theorist's view, Wellington, 2009.
  • Computability and Euclidean Functions- Midwest Computability Seminar, May 2010, Chicago
  • New Directions and Open Questions (in Algorithmic Randomness) 5th Computability and Randomness Conference, May 2010, Notre Dame
  • Degree Classes via Approximations; and Applications Madison, June 2010
  • Degree Classes via Approximations; and Applications Berkeley, November 2010
  • Generic Decision Complexity, Singapore, November 2010
  • Yet More on Dimensions, Amsterdam, November 2010.
  • Parameterized Complexity, Postive Techniques, Kernelization, University of Western Australia, January 2011.
  • Generic Decision Complexity, CCR, Cape Town, 2011, February 2011.
  • Algorithmic Randomness and Complexity (Colloquium Lecture), Melbourne University, February, 2011.
  • Computably enumerable degrees realized in Pi01 classes, Institute for Mathematical Sciences, Singapore, August 2011
  • A hierarchy of c.e. degrees, unifying classes, and natural definability, Oberwolfach February, 2012.
  • A Parameterized Complexity Tutorial I: positive techniques, LATA 2012, A Coruna March 2012.
  • A Parameterized Complexity Tutorial II: negative toolkit LATA 2012, A Coruna March 2012.
  • My Current Interests in Computation. Isaac Newton Institute, Cambridge, March 2012.
  • Algorithmic Randomness and Complexity University of Leicester, March 2012.
  • A Parameterized Complexity Tutorial I: positive techniques, BCTCS, Manchester April 2012.
  • A Parameterized Complexity Tutorial II: negative toolkit, BCTCS, Manchester April 2012.
  • Strong Jump Traceability I The Incomputable, Chichley Hall, June 2012.
  • Notes on Parameterized Complexity, Dagstuhl, June 2012.
  • Randomness, Computability and Mathematics, CIE, How the World Computes, June 2012.
  • Resolute Sets and Initial Segment Complexity (Preliminary Results), CCR 2012 Cambridge, July 2012.
  • Alan Turing and Computation Santander, August 2012.
  • Randomness from Borel to Turing and into the 21st Century, Santander, August 2012.
  • The Finite Intersection Property and Computability Theory
  • Alan Turing and Computation (Colloquium Talk)
  • Alan Turing, the Birth of Computation, the Power of Mathematics (Public Lecture), Wellington November 2012.
  • The talks below about the finite intersection property contained an claim that there was a FIP bounding minimal degree, and this no longer seems true, so I have fixed the talks, where I still have them.
  • The Finite Intersection Property and Computability Theory, Cornell University and Harvard/MIT, November 2012. (Contains the flawed claim)
  • Recent Progress in Parameterized Upper and Lower Bounds, Cornell University, November 2012.
  • Randomness from Borel through Turing and into the 21st Century, Turing 100 Conference, Boston, November 2012.
  • The Finite Intersection Property and Computability Theory (revised version), Midwest Computability Seminar, Chicago, November 2012.
  • Effectively Categorical Torsion Free Abelian Groups, Joint Meetings, San Diego, January 2013.
  • Basic Parameterized Complexity Primer, Joint Meetings, San Diego, January 2013.
  • My Mathematical Encounters with Anil Nerode, Logical Foundations of Computer Science, San Diego, January 2013.
  • Effectively Categorical Torsion Free Abelian Groups, Joint Meetings, San Diego, January 2013.
  • Effectivity in Abelian Group Theory, Kobe University, April 2013.
  • What have I been thinking about (Parameterized complexity and Heuristics), plenary Shonan, May 2013.
  • Randomness from Borel, though Turing and into the 21st Century, plenary lecture, Randomness Workshop, University of Tokyo, May, 2013
  • Integer Valued Randomness, plenary lecture, Randomness Workshop, University of Tokyo, May, 2013
  • Recent Advances in Multivariant Algorithmics, Colloquium Lecture, Auckland University, May, 2013
  • More on integer valued randomness, National University of Singapore, September 2013.
  • Computable Euclidean functions and computable Euclidean domains, Nanyang University of Technology, September 2013
  • Effectivity in Abelian Group Theory, Asian Logic Conference, Guanzhou, September 2013
  • Alan Turing, the Birth of Computation, the Power of Mathematics (Public Lecture), Masterton, November 2013.
  • Effectivity in Abelian Group Theory, Urbana, April 2014.
  • Integer Valued Randomness, Midwest Computability Conference, University of Chicago, April 2014.
  • Effectivity in Abelian Group Theory, Notre Dame, May 2014.
  • Courcelle's Theorem for Triangulations Maui, July 2014.
  • Alan Turing, Computing, Bletchley, and Mathematics, Wellington Public Lecture, February, 2015. Here is the video of the talk.
  • Courcelle's Theorem for Triangulations (Short version), TAMC, Singapore, May 2015.
  • Courcelle's Theorem for Triangulations (Shorter version), Computability, Probability and Logic. June 9, 2015, Nijmegen
  • Computability in Mathematics-Turing's Legacy, MATCH Kolloquium Lecture, Universit of Heidelberg, June, 2015
  • Alan Turing, Computing, Bletchley, and Mathematics, Singapore Public Library (IMS Public Lecture), Singapore, July, 2015.
  • Codebreaking at Bletchley, Masters Tea, College of Alice and Peter Tan, Singapore, September, 2015.
  • The Life of pi, Masters Tea, College of Alice and Peter Tan, Singapore, April, 2016.
  • Multivariable Algorithmics, Tsingua University and Chinese Academy of Sciences, Beijing April, 2016
  • A minimal degree computable from a weakly 2-generic one. Montpellier, June 2016.
  • Using logic for algorithms, Montpellier, June 2016
  • The computational power of sets of random strings. Luminy, June 2016.
  • Graph Colouring as Mathematical Miniature, Masters Tea, College of Alice and Peter Tan, Singapore, February, 2017.
  • Some Applications of Computability of Mathematics, Darmstadt, June, 2017.
  • Some Applications of Computability of Mathematics, Paul Schupp's 80th, Groups and Computation, Stevens Institute of Technology, June, 2017.