2019
The remarkable expressivity of firstorder logic for profinite groups. Joint work with Dan Segal and Katrin Tent. Algebra and Mathematical Logic, Kazan, June.
Effective metric Scott analysis. Institute of Mathematical Sciences, National University of Singapore, June.
Quantum information science. Mathematical background. School of Computer Science, Auckland University, May.
2018
Topological isomorphism for classes of closed subgroups of Sym(N). Descriptive set theory conference, Bernoulli Center, June. Seminar Talk Uni Bonn October about the same topic.
Closure of resource bounded randomness notions under polynomial time permutations. STACS 2018, Caen, France, February.
Quantum MartinLoef randomness and the ShannonMcMillanBreiman Theorem. Algorithmic questions in dynamical systems, Toulouse, March.
2017
Randomness for infinite sequences of quantum bits. CCR 2017, Mysore, India, July 5.
Sets that coincide with 1/2 − ε of each computable set. Leibniz Zentrum, Dagstuhl, Feb. 17.
Structure within the class of Ktrivial sets. NTU seminar, Feb. 6.
My work with Rod 19952001. Rodfest, Traumati Beach, January 58.
2016
Describing finite groups by firstorder sentences of polylogarithmic length.
With Katrin Tent. LC 2016, Computability special session, University of Leeds, August 5.
Randomness and quantum computation.
Computability and the BSS model, Hiddensee, August 812.
Lowness, Randomness, and Computable Analysis.
Computability in Europe 2016 plenary talk, Paris, June 27July 1.
Lightface Pi03completeness of density sets under effective Wadge reducibility. With Gemma Carotenuto.
CiE 2016 contributed paper, Paris, June.
Randomness connecting to set theory and to reverse mathematics.
Computability, randomness and applications, CIRM Luminy, June.
The complexity of isomorphism between profinite groups.
Cabal seminar, UCLA, March 9.
2015
Randomness and Analysis: a tutorial.
Continuity, Computability, Constructivity (CCC), Sept 2015, Kochel near Munich.
Part 1: Randomness notions and almost everywhere theorems
Part 2: Lebesgue density and its applications to antirandomness
A unifying approach to the Gamma question.
With B. Monin. Logic in Computer Science (LICS), July, Kyoto.
Local compactness for computable Polish metric spaces is Pi11 complete.
With S. Solecki. Contributed to Computability in Europe (CiE), July, Bucharest.
Objects of greatest complexity in their class.
Workshop on Computability Theory (WCT), July, Bucharest.
Multiple recurrence and algorithmic randomness.
Computability, complexity and randomness (CCR), June, Heidelberg.
Interactions of computability and randomness.
London School of Ecomonics, Dept. of Mathematics Seminar talk, May.
The Gamma question and cardinal characteristics.
Sets and Computations, March/April, Inst. Math. Sciences, Singapore.
2014

Compression and Randomness.
Inaugural Lecture, University of Auckland, Oct. Poster. Slides.
An analogy between cardinal characteristics and highness properties of oracles.
Computability, Complexity, and Randomness, May, Inst. Math. Sciences, Singapore.

Differentiability of polynomial time computable functions.
Symposium on Theoretical Aspects of Computer Science (STACS), March, at ENS Lyon.

Groups and firstorder logic.
Department of Mathematics, Feb, University of Western Australia (Perth).
2013

The complexity of similarity relations for Polish metric spaces.
Universality and Homogeneity Trimester, Hausdorff Institute for Mathematics, SeptDec, Bonn.
How the Lebesgue density theorem resolved the covering problem.
Asian Logic Colloquium (ALC), Sept, Guangzhou.
Metric spaces and computability theory.
Sy Friedman's 60th Birthday Confernce, July, in Vienna.

Categoricity for compact computable metric spaces. With A. Melnikov.
Computability in Europe, Milano, July.

Differentiability and porosity
Buenos Aires Semester on computability, complexity, and randomness, FebJune.

Complexity of isomorphism relations
Descriptive set theory and model theory (DSTMT), Indian Statistical Institute, Kolkata, Jan.
2012

Demuth randomness and its variants
CCR, Cambridge, UK, June.

"Almost everywhere'' theorems and algorithmic randomness
CCA, Cambridge, UK, June.

Ten years of triviality
The Incomputable, Chicheley Hall, June.

Complexity of equivalence relations
Logic seminar, NUS, April; KGRC, May, University of Leicester, June (final version).

Randomness interacts with computable and polynomial time analysis
Computability Complexity and Randomness (CCR) at Schloss Dagstuhl, January.

Coding with firstorder formulas
Talk at Universitaet Heidelberg on the occasion of Prof. Klaus Ambos Spies' 60th birthday.
2011

Introductory talk
to the Conference Analysis and Randomness in Auckland 2011.

Ktriviality in computable metric spaces
With A. Melnikov. ARA 2011, Auckland (former version CCA 2011)

Borel Structures and Borel theories
U Paris 7, 2011/KGRC Vienna 2012

Measuring the complexity of Delta2 sets via their changes
Asian Logic Colloquium 2011, Victoria University, Wellington.

Randomness and computable analysis: results and open questions
CCR/A 2011, Cape Town
2010

Interactions of Computability and Randomness
International Congress of Mathematicians (ICM), Hyderabad, 2010

Borel Structures
ICM Satellite meeting, Chennai, 2010

Random objects, and objects of low complexity
Mathematics Department Colloquium, Auckland, 2010

Randomness and differentiability (with J. Miller and V. Brattka).
CCR, Notre Dame, May 2010.
2009

Three Lectures on applying randomness to computability. Assoc. Symb. Logic European Summer Meeting tutorial, Sofia. Slides
or Paper version.

Superhighness and strong jump traceability.
ICALP, Rhodes, Greece, 2009

Future directions in Computability and Randomness.
CCR 2009, Marseille

Upper bounds for ideals in the Turing degrees.
With G. Barmpalias. Asian Logic Collquium, Singapore, 2009

Tutorial on cost functions.
FRG randomness workshop Madison, 2009

Tutorial on randomness via effective descriptive set theory.
FRG randomness workshop Madison, 2009

Cost functions and lowness properties.
Assoc. Symb. Logic. Annual meeting, 2009
200408

Weak reducibilities
CCR 08, Nanjing

Randomness, computability, effective descriptive set theory
TAMC 07, Shanghai

Lowness properties and Highness properties
American Inst. of Mathematics, Palo Alto, August 2006

Randomness via computability theory and effective
descriptive set theory
NUS Singapore, June 2006

Recent results relating computability and randomness
SEALS, U of Florida, Mar 2006

Eliminating concepts: Ktrivial equals low for K
IMS workshop, Singapore, July 2005

Algebras with finite descriptions
Assoc. Symb. Logic summer meeting, Athens, August 2005

Quasifinitely axiomatizable groups
Univ. of Auckland and Univ. Paris, Jan 2005

FApresentable structures: richness and limitations
WAssoc. Symb. Logic 2004, and Univ. Paris, Jan 2005

Randomness Notions and Lowness Properties
VIC2004, Wellington, New Zealand, Feb 2004

Randomness, Ktriviality and Omega
UC Berkeley and UCLA, May 2004
19962003

Computable randomness and lowness.
Kolmogorov complexity and its applications. Dagstuhl, Germany, May 2003

Lowness properties
CL2002, Muenster, Germany

Model theoretic properties of
structures from computability theory , Oberwolfach, Jan 2001

How expressive is the firstorder
language for groups? Math. Dept colloquium, U. of Chicago,
2001

Global properties of degree
structures Boulder computability workshop (AMS), 1999

Model theory of degree
structures, LMPS 99, Krakow, 1999

Definability and undecidability
PUCRio,
1999

Approximations to biinterpretability
with N, XI. Latin American Logic Symposion, Merida, Venezuela, 1998

Homogeneity properties
of
free groups, Albany Group Theory Conference, 1997

Definability Lemmas Kazan
recursion theory meeting (WORCT 97), 1997

Undecidability of the exponential
time degrees and effective algebra
Assoc. Symb. Logic meeting, 1997

(joint with Shore and Slaman) Coding
and definability in the r.e degrees
Oberwolfach, 1996