Logic Seminar (2010)

The Penn State Logic Seminar traditionally and normally meets on Tuesdays, 2:30 to 3:45 PM. Our usual meeting place is 315 McAllister. For more precise information, please check the calendar below.

Logic Seminar (2010)
DateRoomSpeaker(s)Title
26 Jan 2010 2:30pm - 3:45pm315 McAllisterNicholas Rupprecht"Universal" Schnorr null sets
02 Feb 2010 2:30pm - 3:45pm315 McAllisterGeorge BarmpaliasRandomness, partial relativization, and domination
16 Feb 2010 2:30pm - 3:45pm315 McAllisterStephen G. SimpsonInvariant measures, computability, and reverse mathematics
23 Feb 2010 2:30pm - 3:45pm315 McAllisterStephen G. SimpsonTiling problems and 2-dimensional symbolic dynamics
02 Mar 2010 2:30pm - 3:45pm315 McAllisterAlexander ShenEverywhere complex sequences and forbidden patterns
16 Mar 2010 2:30pm - 3:45pm315 McAllisterJan ReimannOld and New Results on Algorithmic Equivalence Relations
23 Mar 2010 2:30pm - 3:45pm315 McAllisterAlexander ShenMartin-Lof randomness with respect to arbitrary measures and randomness deficiencies
30 Mar 2010 2:30pm - 3:45pm315 McAllisterJoseph S. MillerRandomness and differentiability
06 Apr 2010 2:30pm - 3:45pm315 McAllisterAlexander ShenEverywhere complex sequences and the probabilistic method
13 Apr 2010 2:30pm - 3:45pm315 McAllisterJohn ClemensInjective selectors, pointed trees, and randomness
20 Apr 2010 2:30pm - 3:45pm315 McAllisterStephen G. SimpsonNeutral measures, continuous degrees, and the Brouwer fixed point theorem
27 Apr 2010 2:30pm - 3:45pm315 McAllisterPhil HudelsonAn introduction to effective Hausdorff dimension
24 Aug 2010 2:30pm - 3:45pm315 McAllisterStephen G. SimpsonOrganizational meeting
31 Aug 2010 2:30pm - 3:45pm315 McAllisterStephen G. SimpsonSymbolic dynamics: entropy = dimension = complexity
07 Sep 2010 2:30pm - 3:45pm315 McAllisterPhil HudelsonIntroduction to Kolmogorov complexity and effective Hausdorff dimension
14 Sep 2010 2:30pm - 3:45pm315 McAllisterJan ReimannKolmogorov complexity and geometric measure theory
21 Sep 2010 2:30pm - 3:45pm315 McAllisterSankha Basu, Phil Hudelson, Noopur PathakShort presentations
28 Sep 2010 2:30pm - 3:45pm315 McAllisterCristobal RojasErgodic-theoretic characterizations of randomness
05 Oct 2010 2:30pm - 3:45pm315 McAllisterJan ReimannKolmogorov complexity and geometric measure theory, part 2
12 Oct 2010 2:30pm - 3:45pm315 McAllisterPhil HudelsonMass problems and initial segment complexity
19 Oct 2010 2:30pm - 3:45pm315 McAllisterManfred DenkerAn algorithm to compute pseudo-random numbers in dynamical systems
26 Oct 2010 2:30pm - 3:45pm315 McAllisterAdrian MalerComputable functions of a computable real variable
02 Nov 2010 2:30pm - 3:45pm315 McAllisterNoopur PathakRandomness and differentiability
09 Nov 2010 2:30pm - 3:45pm315 McAllisterSankha BasuSheaf semantics for higher-order intuitionistic logic
16 Nov 2010 2:30pm - 3:45pm315 McAllisterJeremy AvigadInverting the Furstenberg correspondence
30 Nov 2010 2:30pm - 3:45pm315 McAllisterDaniel ThompsonTopological pressure for non-compact sets, Kamae entropy and Kolmogorov complexity
07 Dec 2010 2:30pm - 3:45pm315 McAllisterAdam DayThe power of random strings
Archives 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007

The slides for Simpson's Fall 2007 series of talks on mass problems are available.

See also the Penn State Logic Seminar Archive covering the years 1998 - 2006.