Some Talks

	Randomness and Partial Relativization Meeting: European Logic Colloquium (ASL meeting), Sofia Year: 2009 Format:
	Tracing and domination in the Turing degrees Meeting: 11th Asian Logic Colloquium, Singapore and Computability in Europe Conference, Heidelberg, Summer 2009 Year: 2009 Format:
	Degrees of computability and degrees of compressibility Meeting: 4th Conference on Logic Computability and Randomness, Marseille, France Year: 2009 Format:
	Computability and Randomness Meeting: Logic seminar in the University of North Texas Year: 2009 Format:
	PA degrees, $\Pi^0_1$ classes and Relative Randomness Meeting: Computability and Randomness meeting, Nanjing, China Year: 2008 Format:
	Randomness, Lowness and Degrees Meeting: Theory and Applications of Models of Computation 2007 (TAMC07) Shanghai, China Year: 2007 Format:
	Computably enumerable splittings, randomness and lowness Meeting: Computability and Randomness workshop, Auckland New Zealand Year: 2007 Format:
	Relative Randomness and cardinality Meeting: NZ math society and AMS 1st joint meeting, Wellington, New Zealand Year: 2007 Format:
	Randomness, Lowness and Domination Meeting: MATHLOGAPS summer school, Leeds, U.K Year: 2006 Format:
	Introduction to Randomness Meeting: Computability Theory Seminar, University of Leeds, U.K. Year: 2005 Format:
	Random Reals and Lipschitz Continuity Meeting: Logic Colloquium, Athens, Greece Year: 2005 Format:
	Computably enumerable sets in the Solovay and the Strong Weak Truth Table Degrees Meeting: First Conference on Computability in Europe, CiE 2005, Amsterdam. Year: 2005
	A c.e. real which cannot be sw-computed by any random c.e. real Meeting: Theory and Applications of Models of Computation, Kunming, China, Year: 2005 Format:
	Computably Enumerable Sets in the sw Degrees Meeting: British Logic Colloquium, Leeds, U.K. Year: 2004 Format: