CCA-CCR 2011 Programme (Time zone: Africa/Johannesburg)

Monday, January 31, 2011

08:00-08:30
Registration
MAM Reception
08:30-09:00
Opening
M320
09:00-10:00
Theodore A. Slaman: Structures Reflecting Recursion Theoretic Properties (invited)
M320
10:00-10:30
André Nies and Alexander Melnikov: Randomness and K-Triviality in Computable Metric Spaces
UCT, Mathematics Building, M320
10:30-11:00
Coffee Break
MAM Tea Room
11:00-11:30
Kenshi Miyabe: Algorithmic Randomness over General Spaces
UCT, Mathematics Building, M320
11:30-12:00
George Davie and Willem Fouché: Layerwise Computable Properties of Complex Oscillations
UCT, Mathematics Building, M320
12:00-13:00
Mathieu Hoyrup: Computable Analysis and Algorithmic Randomness (invited)
UCT, Mathematics Building, M320
13:00-14:30
Lunch Break
UCT Club
14:30-15:30
Rod Downey: Generic Case Decision Problems
UCT, Mathematics Building, M320
15:30-16:00
Coffee Break
MAM Tea Room
16:00-16:30
Daniil Ryabko and Boris Ryabko: Perfect Steganography and Kolmogorov Complexity
UCT, Mathematics Building, M320
16:30-17:00
Zhanna Reznikova and Boris Ryabko: Using Ideas of Kolmogorov Complexity to Study Behavioural Patterns in Animals
UCT, Mathematics Building, M320

Tuesday, February 1, 2011

09:00-09:30
Laurent Bienvenu: Some Results on Solovay Functions
UCT, Mathematics Building, M320
09:30-10:00
Jan Reimann: The Strength of the Besicovich-Davies Theorem
UCT, Mathematics Building, M320
10:00-10:30
Klaus Weihrauch and Cristóbal Rojas: The Radon-Nikodym Operator is not Computable
UCT, Mathematics Building, M320
10:30-11:00
Coffee Break
MAM Tea Room
11:00-11:30
Arno Pauly and Kojiro Higuchi: The Degree Structure of Weihrauch Reducibility
UCT, Mathematics Building, M320
11:30-12:00
Vasco Brattka, Guido Gherardi and Alberto Marcone: The Bolzano-Weierstraß Theorem is the Jump of Weak König's Lemma
UCT, Mathematics Building, M320
12:00-13:00
Matthias Schröder: The Coincidence Problem in Computable Analysis (invited)
UCT, Mathematics Building, M320
13:00-14:30
Lunch Break
UCT Club
14:30-15:30
Michael Yampolsky (video conference): Thurston Equivalence and Algorithmic Decidability (invited)
UCT, Mathematics Building, M320
15:30-16:00
Coffee Break
MAM Tea Room
16:00-16:30
Martin Ziegler: Relative Computability and Uniform Continuity of Relations
UCT, Mathematics Building, M320
16:30-17:00
Sponsor Presentation - Dimension Data
UCT, Mathematics Building, M320

Wednesday, February 2, 2011

09:00-10:00
Verónica Becher: A Better Complexity of Finite Sequences (invited)
UCT, Mathematics Building, M320
10:00-10:30
Yann Bugeaud: Transcendence of Irrational Automatic Numbers
UCT, Mathematics Building, M320
10:30-11:00
Coffee Break
MAM Tea Room
11:00-11:30
Luke Friedman, Eric Allender and William Gasarch: Limits on the Computational Power of Random Strings
UCT, Mathematics Building, M320
11:30-12:00
Kohtaro Tadaki: A Chaitin Omega Number Based on Compressible Strings
UCT, Mathematics Building, M320
12:00-12:30
Christine Gaßner: A General BSS Model over Arbitrary Structures
UCT, Mathematics Building, M320
12:30-13:00
Vladik Kreinovich: Negative Results of Computable Analysis Disappear If We Restrict Ourselves to Random (Or, More Generally, Typical) Inputs
UCT, Mathematics Building, M320
13:00-14:30
Lunch Break
UCT Club
14:30-15:30
Peter Schuster: Proofs by Induction (invited)
UCT, Mathematics Building, M320
15:30-16:00
Coffee Break
MAM Tea Room
16:00-16:30
Douglas Bridges: Weak-Operator Continuous Linear Functionals
UCT, Mathematics Building, M320
16:30-17:00
Thomas Steinke: Constructive Notions of Compactness in Apartness Spaces
UCT, Mathematics Building, M320

Thursday, February 3, 2011

09:00-10:00
Noam Greenberg: Demuth Randomness and Strong Jump-Traceability (invited)
UCT, Mathematics Building, M320
10:00-10:30
Jason Teutsch, Bjørn Kjos-Hanssen and Frank Stephan: Enumerating Randoms
UCT, Mathematics Building, M320
10:30-11:00
Coffee Break
MAM Tea Room
11:00-11:30
Johanna Franklin and Keng Meng Ng: Strengthening Difference Randomness
UCT, Mathematics Building, M320
11:30-12:00
Marius Zimand: Combinatorial Characterizations of Extractors and Kolmogorov Extractors
UCT, Mathematics Building, M320
12:00-13:00
Wolfgang Merkle: Solovay Functions (invited)
UCT, Mathematics Building, M320
13:00-14:00
Lunch Break
UCT Club
14:00-17:30
Excursion - Stellenbosch
Start at the UCT Club
17:30-22:00
Dinner - Zorgvliet Wine Estate

Friday, February 4, 2011

09:00-10:00
Willem Fouché: On Countable Total Orders which are Martin-Löf Random (invited)
UCT, Mathematics Building, M320
10:00-10:30
Safari Mukeru: Group-Theoretic Structure of Zero Sets of Complex Oscillations
UCT, Mathematics Building, M320
10:30-11:00
Coffee Break
MAM Tea Room
11:00-11:30
Kohtaro Tadaki: Properties of Fibers of Optimal Prefix-Free Machines
UCT, Mathematics Building, M320
11:30-12:00
Rupert Hölzl and Wolfgang Merkle: Traceable Sets
UCT, Mathematics Building, M320
12:00-12:30
Takakazu Mori, Yoshiki Tsuji and Mariko Yasugi: Fine Computability of Probability Distribution Functions and Computability of Probability Distributions on the Real Line
UCT, Mathematics Building, M320
12:30-13:00
Robert Rettinger: Compactness and the Effectivity of Uniformization
UCT, Mathematics Building, M320
13:00-14:30
Lunch Break
UCT Club
14:30-15:30
André Nies: Randomness and Computable Analysis: Results and Open Questions (invited)
UCT, Mathematics Building, M320
15:30-16:00
Coffee Break
MAM Tea Room

Saturday, February 5, 2011

11:00-13:30
Post-Conference Tour - Simonstown
Start at Little Scotia Guest House
13:30-15:00
Boulders - Pinguins
15:00-18:00
Cape Point Nature Reserve
18:00-19:00
Cape of Good Hope
19:00-21:00
Trip back to Waterfront (optional) or Guest House