skip to content
 

Seminars (SASW04)

Videos and presentation materials from other INI events are also available.

Search seminar archive

Date Time Speaker Title Presentation Material
2nd July 2012 09:30 to 10:30 J Lutz Alan Turing in the twenty-first century: normal numbers, randomness, and finite automata
2nd July 2012 11:00 to 12:00 A Nies Demuth randomness and its variants
2nd July 2012 12:00 to 12:30 S Sanders Nonstandard Analysis: a new way to compute
2nd July 2012 14:00 to 15:00 A Shen Topological arguments in Kolmogorov complexity
2nd July 2012 15:00 to 15:30 K Miyabe Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness
2nd July 2012 17:00 to 17:30 T Petrovic Two betting strategies that predict all compressible sequences
2nd July 2012 17:30 to 18:00 J Rute Computable randomness and its properties
3rd July 2012 09:00 to 10:00 S Simpson Propagation of partial randomness
3rd July 2012 10:00 to 10:30 P Cholak Computably enumerable partial orders
3rd July 2012 11:00 to 12:00 V Brattka On the computational content of the Baire Category Theorem
3rd July 2012 12:00 to 12:30 C Porter Trivial measures are not so trivial
3rd July 2012 14:00 to 15:00 M Hoyrup On the inversion of computable functions
3rd July 2012 15:00 to 15:30 I Herbert (Almost) Lowness for K and finite self-information
3rd July 2012 17:00 to 17:30 B Bauwens Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
4th July 2012 09:00 to 10:00 J M Hitchcock Limitations of Efficient Reducibility to the Kolmogorov Random Strings
4th July 2012 10:00 to 10:30 M Zimand Language compression for sets in P/poly
4th July 2012 11:00 to 12:00 M Koucky The story of superconcentrators – the missing link
4th July 2012 12:00 to 12:30 D Nguyen Autoreducibility for NEXP
5th July 2012 09:00 to 10:00 D Turetsky SJT-hardness and pseudo-jump inversion
5th July 2012 10:00 to 10:30 J Teutsch Translating the Cantor set by a random
5th July 2012 11:00 to 12:00 G Barmpalias Exact pairs for the ideal of the $K$-trivial sequences in the Turing degrees
5th July 2012 12:00 to 12:30 P A Heiber Normality and Differentiability
5th July 2012 14:00 to 14:30 W Fouche Kolmogorov complexity and Fourier aspects of Brownian motion
5th July 2012 14:30 to 15:00 J Franklin Ergodic theory and strong randomness notions
5th July 2012 15:00 to 15:30 Z Reznikova Integration of ideas and methods of Kolmogorov Complexity and classical mathematical statistics
5th July 2012 17:00 to 17:30 D Ryabko Limit capacity of non-stochastic steganographic systems and Hausdorff dimension
6th July 2012 10:00 to 10:30 K Tadaki Cryptography and Algorithmic Randomness
6th July 2012 11:00 to 12:00 A Lewis The typical Turing degree
6th July 2012 12:00 to 12:30 H Takahashi Algorithmic randomness and stochastic selection function
6th July 2012 14:00 to 15:00 A Day Cupping with random sets
6th July 2012 16:00 to 17:00 R Downey Resolute sets and initial segment complexity
University of Cambridge Research Councils UK
    Clay Mathematics Institute The Leverhulme Trust London Mathematical Society Microsoft Research NM Rothschild and Sons