Charles M. Harris

Talks

Introduction to Enumeration Reducibility

Proofs, Constructions and Computations Seminar, School of Mathematics, University of Leeds.

21st June 2017.

Proofs, Constructions and Computations Seminar, School of Mathematics, University of Leeds.

21st June 2017.

Observations on Linear Orders and Reverse Mathematics

Logic Seminar, School of Mathematics, University of Leeds.

8th June 2016.

Logic Seminar, School of Mathematics, University of Leeds.

8th June 2016.

The Complexity of Maximal Block Functions of η-Like Computable Linear Orderings

Logic and Set Theory Seminar, School of Mathematics, University of Bristol.

3rd June 2014.

Logic and Set Theory Seminar, School of Mathematics, University of Bristol.

3rd June 2014.

Oracle Constructions in the Local Enumeration Degrees

Seminar on Mathematical Logic, FMI, Sofia University.

24th June 2010.

Seminar on Mathematical Logic, FMI, Sofia University.

24th June 2010.

Introduction to Enumeration Reducibility

Computability Seminar, School of Mathematics, University of Leeds.

3rd November 2009.

Computability Seminar, School of Mathematics, University of Leeds.

3rd November 2009.

Introduction to Positive Reducibilities - Part II

Computability Seminar, School of Mathematics, University of Leeds.

11th November 2008.

Computability Seminar, School of Mathematics, University of Leeds.

11th November 2008.

Introduction to Positive Reducibilities - Part I

Computability Seminar, School of Mathematics, University of Leeds.

4th November 2008.

Computability Seminar, School of Mathematics, University of Leeds.

4th November 2008.

Symmetric Enumeration Reducibility - Part I

Computability Seminar, School of Mathematics, University of Leeds.

4th October 2005.

Computability Seminar, School of Mathematics, University of Leeds.

4th October 2005.

Symmetric Enumeration Reducibility - Parts II and III

Computability Seminar, School of Mathematics, University of Leeds.

18th and 25th October 2005.

Computability Seminar, School of Mathematics, University of Leeds.

18th and 25th October 2005.

Lambda Calculus and Enumeration Reducibility

Logic Seminar, School of Mathematics, University of Leeds.

28th February 2005.

Logic Seminar, School of Mathematics, University of Leeds.

28th February 2005.

The Complexity of Maximal Block Functions of η-Like Computable Linear Orderings

Journées Calculabilités, Montpellier.

28th April 2014.

Journées Calculabilités, Montpellier.

28th April 2014.

Goodness and Jump Inversion in the Enumeration Degrees

*Classical Computability Theory* Special Session, Computability in Europe, Sofia.

1st July 2011.

1st July 2011.

Finite Injury Constructions for Noncuppability in the Enumeration Degrees

Contributed Talk, Computability in Europe, Heidelberg.

23rd July 2009.

Contributed Talk, Computability in Europe, Heidelberg.

23rd July 2009.

Jump Classes of Noncuppable Enumeration Degrees

Workshop on Computability Theory, Sofia.

7th August 2009.

Workshop on Computability Theory, Sofia.

7th August 2009.

Enumeration Reducibility with Polynomial Time Bounds

Contributed Talk, Computability in Europe, Swansea.

3rd July 2006.

Contributed Talk, Computability in Europe, Swansea.

3rd July 2006.

Symmetric Enumeration Reducibility

Contributed Talk, Computability in Europe, Amsterdam.

8th June 2005.

Contributed Talk, Computability in Europe, Amsterdam.

8th June 2005.