Workshop Programme
for period 2-6 July
CCR 2012: 7th Conference on Computability, Complexity and Randomness
2-6 July
Timetable
| Monday 02 July | ||
| 09:00-09:25 | Registration | SAS |
| 09:25-09:30 | Welcome | SAS |
| 09:30-10:30 | Lutz, J (Iowa State University) | SAS |
| Alan Turing in the twenty-first century: normal numbers, randomness, and finite automata | Sem 1 | |
| 10:30-11:00 | Morning coffee | SAS |
| 11:00-12:00 | Nies, A (University of Auckland) | SAS |
| Demuth randomness and its variants | Sem 1 | |
| 12:00-12:30 | Sanders, S (Universiteit Gent) | SAS |
| Nonstandard Analysis: a new way to compute | Sem 1 | |
| 12:30-13:30 | Lunch at Wolfson Court. | SAS |
| 14:00-15:00 | Shen, A (Université de Montpellier 2) | SAS |
| Topological arguments in Kolmogorov complexity | Sem 1 | |
| 15:00-15:30 | Miyabe, K (Kyoto University) | SAS |
| Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness | Sem 1 | |
| 15:30-16:00 | Afternoon tea | SAS |
| 17:00-17:30 | Petrovic, T (University of Zagreb) | SAS |
| Two betting strategies that predict all compressible sequences | Sem 1 | |
| 17:30-18:00 | Rute, J (Carnegie Mellon University) | SAS |
| Computable randomness and its properties | Sem 1 | |
| 18:00-18:30 | Welcome Drinks Reception | SAS |
| Tuesday 03 July | ||
| 09:00-10:00 | Simpson, S (Pennsylvania State University) | SAS |
| Propagation of partial randomness | Sem 1 | |
| 10:00-10:30 | Cholak, P (University of Notre Dame) | SAS |
| Computably enumerable partial orders | Sem 1 | |
| 10:30-11:00 | Morning coffee | SAS |
| 11:00-12:00 | Brattka, V (University of Cape Town) | SAS |
| On the computational content of the Baire Category Theorem | Sem 1 | |
| 12:00-12:30 | Porter, C (University of Notre Dame) | SAS |
| Trivial measures are not so trivial | Sem 1 | |
| 12:30-13:30 | Lunch at Wolfson Court | SAS |
| 14:00-15:00 | Hoyrup, M (INRIA Paris - Rocquencourt) | SAS |
| On the inversion of computable functions | Sem 1 | |
| 15:00-15:30 | Herbert, I (University of California, Berkeley) | SAS |
| (Almost) Lowness for K and finite self-information | Sem 1 | |
| 15:30-16:00 | Afternoon Tea | SAS |
| 17:00-17:30 | Bauwens, B (Universidade do Porto) | SAS |
| Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs | Sem 1 | |
| 20:00-22:15 | "Codebreaker" movie | SAS |
| Wednesday 04 July | ||
| 09:00-10:00 | Hitchcock, J M (University of Wyoming) | SAS |
| Limitations of Efficient Reducibility to the Kolmogorov Random Strings | Sem 1 | |
| 10:00-10:30 | Zimand, M (Towson University) | SAS |
| Language compression for sets in P/poly | Sem 1 | |
| 10:30-11:00 | Morning Coffee | SAS |
| 11:00-12:00 | Koucky, M (Academy of Sciences of the Czech Republic) | SAS |
| The story of superconcentrators – the missing link | Sem 1 | |
| 12:00-12:30 | Nguyen, D (University at Buffalo) | SAS |
| Autoreducibility for NEXP | Sem 1 | |
| 12:30-13:30 | Lunch at Wolfson Court | SAS |
| 13:30-17:00 | Excursion | SAS |
| 19:30-22:00 | Conference Dinner at Emmanuel College | SAS |
| Thursday 05 July | ||
| 09:00-10:00 | Turetsky, D (Victoria University of Wellington) | SAS |
| SJT-hardness and pseudo-jump inversion | Sem 1 | |
| 10:00-10:30 | Teutsch, J (Pennsylvania State University) | SAS |
| Translating the Cantor set by a random | Sem 1 | |
| 10:30-11:00 | Morning Coffee | SAS |
| 11:00-12:00 | Barmpalias, G (Chinese Academy of Sciences) | SAS |
| Exact pairs for the ideal of the $K$-trivial sequences in the Turing degrees | Sem 1 | |
| 12:00-12:30 | Heiber, P A (Universidad de Buenos Aires) | SAS |
| Normality and Differentiability | Sem 1 | |
| 12:30-13:30 | Lunch at Wolfson Court | SAS |
| 14:00-14:30 | Fouche, W (University of South Africa) | SAS |
| Kolmogorov complexity and Fourier aspects of Brownian motion | Sem 1 | |
| 14:30-15:00 | Franklin, J (University of Connecticut) | SAS |
| Ergodic theory and strong randomness notions | Sem 1 | |
| 15:00-15:30 | Reznikova, Z (Novosibirsk State University) | SAS |
| Integration of ideas and methods of Kolmogorov Complexity and classical mathematical statistics | Sem 1 | |
| 15:30-16:00 | Afternoon Tea | SAS |
| 17:00-17:30 | Ryabko, D (INRIA, Lille, France) | SAS |
| Limit capacity of non-stochastic steganographic systems and Hausdorff dimension | Sem 1 | |
| Friday 06 July | ||
| 10:00-10:30 | Tadaki, K (Chuo University) | SAS |
| Cryptography and Algorithmic Randomness | Sem 1 | |
| 10:30-11:00 | Morning Coffee | SAS |
| 11:00-12:00 | Lewis, A (University of Leeds) | SAS |
| The typical Turing degree | Sem 1 | |
| 12:00-12:30 | Takahashi, H (University of Electro-Communications, Tokyo) | SAS |
| Algorithmic randomness and stochastic selection function | Sem 1 | |
| 12:30-13:30 | Lunch at Wolfson Court | SAS |
| 14:00-15:00 | Day, A (University of California, Berkeley) | SAS |
| Cupping with random sets | Sem 1 | |
| 15:30-16:00 | Afternoon Tea | SAS |
| 16:00-17:00 | Downey, R (Victoria University of Wellington) | SAS |
| Resolute sets and initial segment complexity | Sem 1 | |
| Other Seminars |
|
Seminars in the University National and International Scientific Research Meetings |