School of Mathematics

Search site

Department of Pure Mathematics

Computability Theory seminar

Spring 2017

All Seminars 4pm, in the MAGIC room, except where otherwise stated.
Directions: At the School of Mathematics proceed to the RVC on Level 10.
Seminar organiser - James Gay

 

Forthcoming seminars

To be announced.

 

Past seminars
Tue 1st March, 2016
5:00 PM

James Gay (Leeds)
Linearisations of well-founded computable orderings
Tue 9th February, 2016
5:00 PM

Ingram Bondin (Leeds)
High Permitting
Tue 8th December, 2015
5:00 PM

Robert Lubarsky (Florida Atlantic University)
Context-Dependent Deterministic Parallel Feedback Turing Machines
Tue 1st December, 2015
5:00 PM

Richard Whyman (Leeds)
What does it mean to physically compute something?
Tue 17th November, 2015
5:00 PM

David Toth (Leeds)
A Survey of Higher Computability Theory
Tue 3rd November, 2015
5:00 PM

James Riley (University of Leeds)
Construction by a tree of priority
Tue 20th October, 2015
5:00 PM

Ingram Bondin (Leeds)
Laszlo Kalmar's Objection to Church's Thesis
Tue 13th October, 2015
5:00 PM

Ingram Bondin (Leeds)
Lerman's Framework for Priority Arguments
Tue 28th April, 2015
4:00 PM

James Gay (University of Leeds)
Computably extendable order types
Tue 24th March, 2015
4:00 PM

Ingram Bondin (University of Leeds)
Splittings and Non-Splittings in the c.e. Degrees III
Tue 17th March, 2015
4:00 PM

David Toth (University of Leeds)
The automorphism group of the enumeration structures
Tue 25th November, 2014
4:00 PM

Ingram Bondin (University of Leeds)
Splittings and Non-Splittings in the c.e. Degrees II
Tue 18th November, 2014
4:00 PM

Ingram Bondin (University of Leeds)
Splittings and Non-Splittings in the c.e. Degrees
Wed 28th May, 2014
1:00 PM

Charles Harris (University of Bristol)
The Complexity of Maximal Block Functions of eta-like Computable Linear Orderings
Tue 25th March, 2014
4:00 PM

Ahmet Cevik (Leeds)
Degree theoretic properties in effectively closed sets
Tue 18th March, 2014
4:00 PM

Benedict Durrant (Leeds)
Some properties of local degree structures
Tue 25th February, 2014
4:00 PM

Ingram Bondin (University of Leeds)
Higher Type Computability (Kleene S1-S9)
Tue 11th February, 2014
4:00 PM

Ingram Bondin (University of Leeds)
Comparing models of computation
Mon 2nd December, 2013
5:00 PM

Benedict Durrant (Leeds)
Structural properties concerning minimal degrees
Tue 19th November, 2013
4:00 PM

Mark Carney (University of Leeds)
Turing and Enumerable Tilings
Tue 5th November, 2013
4:00 PM

James Riley (University of Leeds)
Priority arguments and minimal degrees below 0'
Tue 15th October, 2013
4:00 PM

Liliana Badillo (Leeds)
Enumeration 1-genericity
Tue 1st October, 2013
4:00 PM

Barry Cooper (Leeds)
Enumeration Degrees
Tue 26th February, 2013
4:00 PM

Liliana Badillo (Leeds)
Yates' Index Set Theorem
Tue 12th February, 2013
4:00 PM

James Gay (Leeds)
Computable chain covers of partial orders
Tue 11th December, 2012
4:00 PM

James Riley (University of Leeds)
Lewis Carroll's game of logic
Tue 4th December, 2012
4:00 PM

Stefan Vatek (University of Leeds)
Jump inversion in abstract structures 2
Tue 27th November, 2012
4:00 PM

Stefan Vatek (University of Leeds)
Jump inversion in abstract structures 1
Tue 20th November, 2012
4:00 PM

Ahmet Cevik (University of Leeds)
tba
Tue 13th November, 2012
4:00 PM

Benedict Durrant (University of Leeds)
An introduction to game theory
Tue 6th November, 2012
4:00 PM

Benedict Durrant (University of Leeds)
A 1-generic which does not have the meet property
Tue 30th October, 2012
4:00 PM

Stijn Vermeeren (University of Leeds)
Notions of Algorithmic Randomness 2
Tue 23rd October, 2012
4:00 PM

Stijn Vermeeren (University of Leeds)
Notions of Algorithmic Randomness 1
Tue 16th October, 2012
4:00 PM

Liliana Badillo (University of Leeds)
Notions of 1-genericity
Tue 22nd May, 2012
4:00 PM

Ahmet Cevik (University of Leeds)
On the Length of Infinite Time Turing Machine Computations
Tue 15th May, 2012
4:00 PM

Benedict Durrant (University of Leeds)
A 1 Generic which is not a Minimal Cover
Tue 8th May, 2012
4:00 PM

Benedict Durrant (University of Leeds)
1 Generics
Tue 1st May, 2012
4:00 PM

Liliana Badillo (University of Leeds)
Prime Ideals of \Pi{^0}{_2} Enumeration Degrees
Tue 24th April, 2012
4:00 PM

Stijn Vermeeren (University of Leeds)
Axioms of Strings of High Complexity
Tue 17th April, 2012
4:00 PM

Stijn Vermeeren (University of Leeds)
Axiomatic String Complexity
Tue 15th March, 2011
4:00 PM

Ahmet Cevik (Leeds)
Degrees of the Members of Pi^0_1 Classes
Tue 8th March, 2011
4:00 PM

Stijn Vermeeren (Leeds)
Permutation and Injection Randomness
Tue 7th December, 2010
4:00 PM

Mariya Soskova (Sofia University)
The Total Degrees in the Local Structure of the Enumeration Degrees
Tue 30th November, 2010
4:00 PM

Stijn Vermeeren (Leeds)
Computable Randomness Notions, Part 1: Separating the Notions
Tue 23rd November, 2010
4:00 PM

Stijn Vermeeren (Leeds)
Computable Randomness Notions, Part 1: Relative Strength
Tue 16th November, 2010
4:00 PM

Liliana Badillo (University of Leeds)
The Existence of 1-Generic Sets below a 1-Generic Degree < 0'
Tue 9th November, 2010
4:00 PM

Liliana Badillo (University of Leeds)
Introduction to Genericity in the Enumeration Degrees
Thu 4th November, 2010
4:00 PM

Professor Cristian Calude (Auckland, New Zealand)
Representability of the $\varepsilon$-Random Reals
Tue 23rd March, 2010
4:00 PM

Stijn Vermeeren (Leeds)
The Entscheidungsproblem and the Decidability of S2S
Tue 23rd February, 2010
4:00 PM

Alexandra Soskova (Sofia)
Enumeration Degree Spectra of Abstract Structures
Tue 16th February, 2010
4:00 PM

Hristo Ganchev (University of Sofia)
Structural Properties of the Sigma^0_2 Enumeration Degrees
Tue 1st December, 2009
4:00 PM

Andy Lewis (Leeds)
An Introduction to the Arithmetical Hierarchy, focussing on $\Pi^0_1$ Classes. Part II
Tue 24th November, 2009
4:00 PM

Andy Lewis (Leeds)
An Introduction to the Arithmetical Hierarchy, focussing on $\Pi^0_1$ Classes. Part I
Tue 17th November, 2009
4:00 PM

Charles Harris (Leeds)
The Local Enumeration Degrees
Tue 3rd November, 2009
4:00 PM

Charles Harris (Leeds)
Enumeration Reducibility
Tue 27th October, 2009
4:00 PM

Kyung Il Lee (Leeds)
Linear Orderings in the Ershov Hierachy and Computable Approximation
Tue 20th October, 2009
4:00 PM

Antonio Montalban (University of Chicago)
The Boundary of Determinacy in Second Order Arithmetic
Tue 13th October, 2009
4:00 PM

Phil Ellison (University of Leeds)
An Introduction To Minimal Degrees. Part I
Tue 12th May, 2009
4:00 PM

Charles Harris (University of Leeds)
Finite Injury Constructions for Noncuppability in the Local Enumeration Degrees
Tue 5th May, 2009
4:00 PM

Mariya Soskova (Sofia University)
Embedding countable partial orderings in degree structures.
Fri 20th March, 2009
2:10 PM

Dr Idris Eckley (University of Lancaster)
TBA
Tue 3rd March, 2009
4:00 PM

Barbara Csima (University of Waterloo, Ontario)
Degree Spectra of Almost Computable Structures
Tue 24th February, 2009
4:00 PM

Barbara Csima (University of Waterloo, Ontario)
Computable Properties of Infinite Graphs with Finite Components
Tue 27th January, 2009
4:00 PM

Mike Stannett (University of Sheffield)
A General Introduction to Hypercomputation
Tue 13th January, 2009
4:00 PM

Antonio Montalban (University of Chicago)
On the Extensions of Embeddings of the USL Below 0'
Tue 9th December, 2008
4:00 PM

Anthony Morphett (Leeds)
Effective Dimension, Part 2
Tue 25th November, 2008
4:00 PM

Anthony Morphett (Leeds)
Effective Dimension
Tue 18th November, 2008
4:00 PM

Charles Harris (Leeds)
Introduction to Positive Reducibilities
Tue 11th November, 2008
4:00 PM

Charles Harris (Leeds)
Introduction to Positive Reducibilities
Tue 4th November, 2008
4:00 PM

Charles Harris (Leeds)
Introduction to Positive Reducibilities