Jan Reimann Penn State, Department of Mathematics


These are slides from selected talks I given over the years at conferences and seminars. For a complete list of my talks please refer to my CV.

  • Effective aspects of diophantine approximation [pdf]
    University of Illinois Chicago Logic Seminar, March 2016
    SEALS 2016, Gainesville, Florida, February 2016
  • Random graphs, finite extension constructions, and complexity [pdf]
    AMS Central Fall Sectional Meeting, Chicago, October 2015
  • Algorithmic randomness and determinacy [pdf]
    UCLA Summer School in Logic, July 2015
  • Stochasticity for random graphs [pdf]
    Conference Varieties of Algorithmic Information, Heidelberg, Germany, June 2015
    (Plenary Talk)
  • The topology of random graphons [pdf]
    IMS National University of Singapore, Singapore, April 2015
    Special Program on Sets and Computations
  • Patterns in Nature [pdf]
    Penn State Brandywine, Spring Speaker Series, April 2015 see also: http://brandywine.psu.edu/story/917/2015/04/02/explore-natures-geometry-nsf-researcher-april-8
  • Algorithmically random point processes [pdf]
    Winter meeting of the Canadian Mathematical Society, Hamilton, ON, December 2014

  • Mini-Course on Algorithmic Randomness
    [Introduction] [Lecture 1] [Lecture 2] [Lecture 3] [Lecture 4] [Lecture 5]
    BASICS Summer School, Shanghai Jiao-Tong University, August 2014
  • Effective multifractal spectra [pdf]
    Department of Mathematics Colloquium, Bloomsburg University, Bloomsburg, PA, March 2014

    Computability Theory and Foundations of Mathematics (CTFM), Tokyo, Japan, February 2014
    Berkeley Logic Colloquium, University of California at Berkeley, January 2014

    Joint Mathematics Meetings, Baltimore, January 2014
    Department of Mathematics Colloquium, University of Florida, Gainesville, November 2013
    AMS Fall Central Sectional Meeting, Washington University, St. Louis, October 2013

  • Definability and Randomness [pdf]
    MIT Logic Seminar, January 2010
  • The Structure of NCR inside Δ_2 [pdf]
    ASL Annual Meeting, Notre Dame, May 2009
    Logic Colloquium, University of Wisconsin, Madison, April 2009
  • Effective Geometric Measure Theory [pdf]
    Department of Mathematics, National University of Singapore, July 2008
    Computability, Complexity, and Randomness, Nanjing, May 2008
    Joint Meeting AMS and NZMS, Wellington, December 2007
  • Mutual Theories of Algorithmic Information [pdf]
    VIG 2008, UCLA, January 2008
  • Measures and Their Random Reals [pdf]
    Department of Mathematics, University of Hawaii, Manoa, April 2009
    ASL Winter Meeting, San Diego, January 2009
  • The Metamathematics of Randomness [pdf]
    Logic Colloquium, UCLA, January 2007
  • Effectively Closed Set of Measures and Randomness [pdf]
    Logic, Computability, and Randomness, Buenos Aires, January 12, 2007
  • Randomness -- Beyond Lebesgue Measure [pdf]
    Department of Mathematics, University of Chicago, November 10, 2006
    Department of Mathematics, University of Notre Dame, November 16, 2006
  • Effective Fractal Dimension [pdf]
    Workshop on Effective Randomness, American Institute of Mathematics, Palo Alto, August 7, 2006
  • The Metamathematics of Algorithmic Randomness [pdf]
    Logic Colloquium 2006, Nijmegen, July 28, 2006
  • Trees of Non-Trivial Hausdorff Measure in Computability Theory
    Theory and Applications of Models of Computation, Beijing, May 2006
  • Fractal Dimensions in Recursion Theory [pdf]
    Logic Colloquium, University of California, Berkeley, April 21, 2006
  • The Effective Dimension of Cones and Degrees [pdf]
    Universität Heidelberg, November 15, 2005
  • Measures and Randomness [pdf]
    University of Auckland, New Zealand, September 30, 2005
    Computational Prospects of Infinity, Singapore, August 5, 2005
  • Kolmogorov-Loveland Randomness and Stochasticity [pdf]
    National University of Singapore, September 15, 2005
    ASL Meeting, Stanford, March 19, 2005
    STACS 2005, Stuttgart, February 25, 2005
  • On Hierarchies of Randomness Tests [pdf]
    Talk given by Frank Stephan at the 9th Asian Logic Conference, Novosibirsk, August 16, 2005
  • Schnorr Dimension [pdf]
    First Conference on Computability in Europe, CiE 2005, Amsterdam, June 11, 2005
  • Hausdorff Dimension, Randomness, and Entropy [pdf]
    Universität Halle-Wittenberg, February 2, 2005
    Colloquium Logicum 2004, Heidelberg, September 18, 2004
  • Random Functions [pdf]
    Logic, Computability and Randomness 2004, Cordoba, Argentina, September 23, 2004
  • Kolmogorov Complexity and Diophantine Approximation [pdf]
    Victoria University of Wellington, New Zealand, March 22, 2004
    Max-Planck-Institut für Mathematik, Bonn, Germany, March 17, 2004
  • Borel normaility, automata, and complexity [pdf]
    Victoria International Conference 2004, Wellington, New Zealand, February 9-13, 2004
  • Hausdorff Dimension, Zufälligkeit und Berechenbarkeit [pdf]
    Obersminar Mathematische Logik, Universität Bonn, December 11, 2003
  • On Selection Functions that Do Not Preserve Normality [pdf]
    MFCS 2003, Bratislava, August 29, 2003
  • Hausdorff measures and perfect subsets [pdf]
    Workshop on Computability and Logic, Heidelberg, June 23-27, 2003.