PSU Mark
Eberly College of Science Mathematics Department

Logic Seminar (2010 Archive)

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.
DateSpeaker(s)Title
26 Jan 2010Nicholas Rupprecht, University of Michigan"Universal" Schnorr null sets
2 Feb 2010George Barmpalias, Institute of Logic, Language, and Computation, University of AmsterdamRandomness, partial relativization, and domination
16 Feb 2010Stephen G. Simpson, Pennsylvania State UniversityInvariant measures, computability, and reverse mathematics
23 Feb 2010Stephen G. Simpson, Pennsylvania State UniversityTiling problems and 2-dimensional symbolic dynamics
2 Mar 2010Alexander Shen, Laboratoire J.-V.Poncelet, Marseille, FranceEverywhere complex sequences and forbidden patterns
16 Mar 2010Jan Reimann, University of California at BerkeleyOld and New Results on Algorithmic Equivalence Relations
23 Mar 2010Alexander Shen, Laboratoire J.-V.Poncelet, Marseille, FranceMartin-Lof randomness with respect to arbitrary measures and randomness deficiencies
30 Mar 2010Joseph S. Miller, University of WisconsinRandomness and differentiability
6 Apr 2010Alexander Shen, Laboratoire J.-V. Poncelet, Marseille, FranceEverywhere complex sequences and the probabilistic method
13 Apr 2010John Clemens, Pennsylvania State UniversityInjective selectors, pointed trees, and randomness
20 Apr 2010Stephen G. Simpson, Pennsylvania State UniversityNeutral measures, continuous degrees, and the Brouwer fixed point theorem
27 Apr 2010Phil Hudelson, Pennsylvania State UniversityAn introduction to effective Hausdorff dimension
24 Aug 2010Stephen G. Simpson, Pennsylvania State UniversityOrganizational meeting
31 Aug 2010Stephen G. Simpson, Pennsylvania State UniversitySymbolic dynamics: entropy = dimension = complexity
7 Sep 2010Phil Hudelson, Pennsylvania State UniversityIntroduction to Kolmogorov complexity and effective Hausdorff dimension
14 Sep 2010Jan Reimann, Pennsylvania State UniversityKolmogorov complexity and geometric measure theory
21 Sep 2010Sankha Basu, Phil Hudelson, Noopur Pathak, Pennsylvania State UniversityShort presentations
28 Sep 2010Cristobal Rojas, University of TorontoErgodic-theoretic characterizations of randomness
5 Oct 2010Jan Reimann, Pennsylvania State UniversityKolmogorov complexity and geometric measure theory, part 2
12 Oct 2010Phil Hudelson, Pennsylvania State UniversityMass problems and initial segment complexity
19 Oct 2010Manfred Denker, Pennsylvania State UniversityAn algorithm to compute pseudo-random numbers in dynamical systems
26 Oct 2010Adrian Maler, Pennsylvania State UniversityComputable functions of a computable real variable
2 Nov 2010Noopur Pathak, Pennsylvania State UniversityRandomness and differentiability
9 Nov 2010Sankha Basu, Pennsylvania State UniversitySheaf semantics for higher-order intuitionistic logic
16 Nov 2010Jeremy Avigad, Carnegie Mellon UniversityInverting the Furstenberg correspondence
30 Nov 2010Daniel Thompson, Pennsylvania State UniversityTopological pressure for non-compact sets, Kamae entropy and Kolmogorov complexity
7 Dec 2010Adam Day, Victoria University of Wellington, New ZealandThe power of random strings
Archives 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.