Abstracts and slides

  • Jan 22. Laurent Bienvenu. Higher randomness and triviality.
    [abstract]    [pdf]
  • Jan 23, 24, 29. Noam Greenberg. Oberwolfach randomness and computing K-trivial sets
    [pdf]
  • Jan 30. Alberto Marcone. Partial orders and reverse mathematics.
    [abstract]    [pdf]
  • Feb 1, 5. Joe Miller. Lebesgue density in Pi^0_1 classes (and K-triviality)
    [abstract]    [pdf]
  • Feb 6. Alexandra Soskova. On Omega Degree Spectra
    [abstract]    [pdf]
  • Feb 13. Daniel Turetsky. SJT as an analog of K-triviality
    [abstract]    [pdf]
  • Feb 14. Ian Herbert. Mutual Information and Weak Lowness Notions
    [abstract]    [pdf]
  • Mar 5. Chris Conidis. Computable Algebra: A Personal Perspective
    [abstract]    [pdf]
  • Mar 7. Greg Igusa. Generic computability, and the strange results that arise in its study
    [abstract]    [pdf]
  • Mar 13. Cameron Freer. A model-theoretic approach to characterizing randomness notions
    [abstract]    [pdf]
  • Mar 14. Gerald Sacks. Extensions of Levy-Shoenfield Absoluteness
    [pdf]
  • Four Lectures On Normal Numbers
    Mar 19. Verónica Becher. Part I. Equivalent Definitions of Normality and Selected Theorems
    Mar 21. Pablo Heiber. Part II. Normality and Incompressibility by Finite Automata
    Mar 26. Verónica Becher and Ted Slaman. Part III. Absolute Normality and Normality in Different Bases
    Mar 27. Santiago Figueira (joint work with André Nies). Part IV. Normality and Polynomial Time Martingales
    [pdf of the 4 lectures]    [proofs of part II]
  • Apr 04. André Nies. Differentiability and porosity
    [abstract]    [pdf]
  • Apr 10. Joe Mileti. Primes in Computable UFDs
    [abstract]    [pdf]
  • Apr 09, 11, 16. Antonio Montalbán. A Computability Theoretic equivalent to Vaught's Conjecture
    [abstract]    [pdf]
  • Apr 17. Alexander Melnikov. Complex isomorphisms of simple computable structures
    [abstract]    [pdf]
  • Apr 18. Peter Cholak. The c.e. sets disjoint from an c.e. set A
    [abstract]    [pdf]
  • Apr 23. Damir Dzhafarov. Strong reductions between combinatorial problems
    [abstract]    [pdf]
  • Apr 24. Quinn Culver. Random Measures
    [abstract]    [pdf]
  • Apr 25. Linda Brown Westrick. A Lightface Analysis of the Differentiability Rank
    [abstract]    [pdf]
  • Apr 30. Mushfeq Khan. Density-one points of Pi^0_1 classes
    [abstract]    [pdf]
  • May 15. Luca San Mauro. C.e. equivalence relations under computable approximations
    [abstract]    [pdf]
  • May 16. Kelty Allen. Martin-Lof Random Brownian Motion
    [abstract]    [pdf]
  • May 21. Johanna Franklin. Lowness in recursive model theory
    [abstract]    [pdf]
  • May 22. Ian Haken. Randomizable Reals
    [abstract]    [pdf]
  • May 28. Denis Hirschfeldt. Coarse Computability and Algorithmic Randomness
    [abstract]    [pdf]
  • May 29. Uri Andrews. Relative computability of models of strongly minimal theories
  • May 30. Keng Meng Ng. The complexity of equivalence relations
    [abstract]    [pdf]
  • Jun 6. Rutger Kuyper. The Muchnik Lattice and Intuitionistic Logic
    [abstract]    [pdf]
  • Jun 10. Iskander Kalimullin. Families of sets and their degree spectra
    [abstract]    [pdf]