Christopher P. Porter

Talks

Here is a list of talks that I've given over the last few years. (I've included links to the slides for the most recent talks.  All other slides are available upon request.)

 

2015

The Logical Approach to Randomness, UConn Logic Colloquium, University of Connecticut, September 18, 2015.

Deep \Pi^0_1 classes, Connecticut Logic Seminar, University of Connecticut, September 17, 2015.

The preservation of algorithmic randomness, Part 1 and Part 2, University of Florida Logic Seminar, Gainesville, Florida, August 28 & September 4, 2015.

Mutual Information, the Independence Postulate, and Depth, Varieties of Algorithmic Information, Heidelberg, Germany, June 15-18, 2015.

The logical approach to randomness, Logic and the Philosophy of Science Department Colloquium, University of California, Irvine, May 12, 2015.

Algorithmic randomness for non-uniform probability measures, Logic and Set Theory Seminar, University of California, Irvine, May 11, 2015.

Coin tossing, randomness extraction, and algorithmic randomness, University of Florida Graduate Mathematics Association, Gainesville, Florida, March 25, 2015.

Algorithmic randomness and non-uniform probability measures, Part 1 and Part 2, University of Florida Logic Seminar, Gainesville, Florida, March 9 & 16, 2015.

Initial segment complexity and randomness for computable measures, Penn State University Logic Seminar, State College, PA, February 10, 2015.

 

2014

Initial segment complexity and randomness for computable measures, Winter Meeting of the Canadian Mathematical Society, Hamilton, Ontario, December 7, 2014.

Negligibility, depth, and algorithmic randomness, Part 1 and Part 2, University of Florida Logic Seminar, Gainesville, Florida, September 5 & 12, 2014.

Effective notions of typicality, "Concepts of genericity in mathematics" (a special seminar I co-organized with Brice Halimi), Université Paris Diderot, Paris, France, June 13, 2014.

The invariant degrees, randomness, and semi-measures, Hauptseminar Mathematische Logik und Theoretische Informatik, Universität Heidelberg, Heidelberg, Germany, May 27, 2014.

The invariant degrees, randomness, and semi-measures, Journées Calculabilités 2014, Université Montpellier 2, Montpellier, France, April 28, 2014.

The Algorithmic Approach to Randomness, Groupe de Travail Mathématiques et Philosophie Contemporaines, Institut de Mathématiques de Toulouse, Université Paul Sabatier, Toulouse, France, March 20, 2014.

Randomness, probability, and computation, AMS-ASL Special Session on Logic and Probability, Joint Mathematics Meetings, Baltimore, Maryland, January 15, 2014.

 

2013

On analogues of the Church-Turing thesis in algorithmic randomness, Munich Center for Mathematical Philosophy, Munich, Germany, December 4, 2013.

Randomness, probability, and computation, Midlands Logic Seminar, Birmingham University, Birmingham, UK, November 29, 2013.

Defining randomness, General audience talk for undergraduate students, Warwick University, Coventry, UK, November 28, 2013.

Effectively closed classes, negligibility, and depth, Hauptseminar Mathematische Logik und Theoretische Informatik, Universität Heidelberg, Heidelberg, Germany, November 19, 2013.

Effectively closed classes, negligibility, and depth, Logic and Analysis Seminar, Universiteit Gent, Ghent, Belgium, November 6, 2013.

Von Mises, Church, and the Birth of Algorithmic Randomness, 2nd International Conference on the History and Philosophy of Computing, École Normale Supérieure, Paris, France, October 28-31, 2013.

Randomness and accessible objects in mathematics, French PhilMath Workshop, Maison des Science de l'Homme, Clermont-Ferrand, France, October 17-19, 2013.

Deep \Pi^0_1 classes, Seminar Theoretische Informatik und Mathematische Logik, Universität der Bun- deswehr München, Munich, Germany, August 7, 2013.

Algorithmic randomness and semi-measures, Logic Colloquium 2013, Évora, Portugal, July 26, 2013.

Strong difference randomness, Computability in Europe 2013, Milan, Italy, July 4, 2013.

Demuth’s work on randomness and analysis, Algorithmic Randomness and Analysis 2013,
Nancy, France, June 28, 2013.

Algorithmic randomness and probabilistic computation, Séminaire Automates, LIAFA, Paris, France, June 14, 2013.

Randomness and semi-measures, Journées Calculabilités 2013, Nancy, France, April 12, 2013.

Revisiting Chaitin’s Incompleteness Theorem, Cambridge Philosophy of Mathematics Seminar, University of Cambridge, February 21, 2013.

 

2012

Trivial Measures are Not So Trivial, Seventh International Conference on Computability, Complexity and Randomness (CCR 2012), University of Cambridge, July 3 2012.

On Analogues of the Church-Turing Thesis in Algorithmic Randomness, Computability in Europe 2012, University of Cambridge, June 19, 2012.

Algorithmic Randomness and Non-Uniform Measures, Workshop on Philosophy and Algorithmic Complexity, Northwestern University, May 5, 2012.

On Analogues of the Church-Turing Thesis in Algorithmic Randomness, Workshop on Philosophy and Algorithmic Complexity, Northwestern University, May 5, 2012.

Algorithmic Randomness and Pathological Computable Measures, Joint Mathematics Meetings, Special Session on the Life and Legacy of Alan Turing, Boston, MA, January 4, 2012.

 

2011

Algorithmic Randomness, Extensional Adequacy, and the Exemplary Ideal of Completeness, An Ideals of Proof Workshop in the History and Philosophy of Mathematics, University of Notre Dame, November 4, 2011.

Algorithmic Randomness, Strong Reductions, and Non-Uniform Measures, Notre Dame Logic Seminar, October 13, 2011.

Randomness and Truth-Table Reducibility, Computability and Randomness in Paris 2011, June 8, 2011.

On Analogues of the Church-Turing Thesis in Algorithmic Randomness, Paris Diderot Philmaths Seminar, May 17, 2011.

Randomness and Truth-Table Reducibility, Association for Symbolic Logic 2011 North American Annual Meeting, Berkeley, CA, March 24, 2011.

Randomness, Learnability, and Depth, Midwest Computability Seminar, University of Chicago, February 15, 2011.

 

2010

Extracting Randomness from the Tosses of a Biased Coin, Notre Dame Mathematics Department Graduate Student Seminar, September 4, 2010.

Effectively Mapping to and from Random Sequences, Fifth Annual Meeting of the Conference of Logic, Computability, and Randomness, University of Notre Dame, May 28, 2010.

Interpreting Algorithmic Randomness, Paris Computability Seminar, Paris, France, March 15, 2010.