CCR 2012: 7th conference on computability, complexity and randomness

Workshop theme

For additional information on the conference please see the External Conference Webpage. Information includes:

topics that will be covered during this forthcoming workshop
previous Computabilitiy, Complexity and Randomness meetings

The application is closed

Timetable

Monday 2nd July 2012
09:00 to 09:25	Registration	No Room Required
09:25 to 09:30	Welcome	Room 1
09:30 to 10:30	Jack Lutz Iowa State University Alan Turing in the twenty-first century: normal numbers, randomness, and finite automata	Room 1
10:30 to 11:00	Morning coffee	No Room Required
11:00 to 12:00	Andre Nies University of Auckland Demuth randomness and its variants	Room 1
12:00 to 12:30	Sam Sanders Universiteit Gent Nonstandard Analysis: a new way to compute	Room 1
12:30 to 13:30	Lunch at Wolfson Court.	No Room Required
14:00 to 15:00	Alexander Shen Université de Montpellier 2; CNRS (Centre national de la recherche scientifique) Topological arguments in Kolmogorov complexity	Room 1
15:00 to 15:30	Kenshi Miyabe Kyoto University Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness	Room 1
15:30 to 16:00	Afternoon tea	No Room Required
17:00 to 17:30	Tomislav Petrovic Boston University; University of Zagreb Two betting strategies that predict all compressible sequences	Room 1
17:30 to 18:00	Jason Rute Carnegie Mellon University Computable randomness and its properties	Room 1
18:00 to 18:30	Welcome Drinks Reception	No Room Required

Tuesday 3rd July 2012
09:00 to 10:00	Steve Simpson Pennsylvania State University Propagation of partial randomness	Room 1
10:00 to 10:30	Peter Cholak University of Notre Dame Computably enumerable partial orders	Room 1
10:30 to 11:00	Morning coffee	No Room Required
11:00 to 12:00	Vasco Brattka Universität der Bundeswehr München; University of Cape Town On the computational content of the Baire Category Theorem	Room 1
12:00 to 12:30	Christopher Porter University of Notre Dame Trivial measures are not so trivial	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 15:00	Mathieu Hoyrup INRIA Paris - Rocquencourt On the inversion of computable functions	Room 1
15:00 to 15:30	Ian Herbert University of California, Berkeley (Almost) Lowness for K and finite self-information	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
17:00 to 17:30	Bruno Bauwens Universidade do Porto Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs	Room 1
20:00 to 22:15	"Codebreaker" movie	Room 1

Wednesday 4th July 2012
09:00 to 10:00	John Hitchcock University of Wyoming Limitations of Efficient Reducibility to the Kolmogorov Random Strings	Room 1
10:00 to 10:30	Marius Zimand Towson University Language compression for sets in P/poly	Room 1
10:30 to 11:00	Morning Coffee	No Room Required
11:00 to 12:00	Michal Koucký Charles University, Prague; Academy of Sciences of the Czech Republic The story of superconcentrators – the missing link	Room 1
12:00 to 12:30	Phuong Nguyen Université de Montréal Autoreducibility for NEXP	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
13:30 to 17:00	Excursion	No Room Required
19:30 to 22:00	Conference Dinner at Emmanuel College	No Room Required

Thursday 5th July 2012
09:00 to 10:00	Daniel Turetsky Victoria University of Wellington SJT-hardness and pseudo-jump inversion	Room 1
10:00 to 10:30	Jason Teutsch Pennsylvania State University Translating the Cantor set by a random	Room 1
10:30 to 11:00	Morning Coffee	No Room Required
11:00 to 12:00	George Barmpalias Chinese Academy of Sciences; Victoria University of Wellington Exact pairs for the ideal of the $K$-trivial sequences in the Turing degrees	Room 1
12:00 to 12:30	Pablo Ariel Heiber Universidad de Buenos Aires Normality and Differentiability	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 14:30	Kolmogorov complexity and Fourier aspects of Brownian motion	Room 1
14:30 to 15:00	Johanna Franklin University of Connecticut Ergodic theory and strong randomness notions	Room 1
15:00 to 15:30	Zhanna Reznikova Pereslavl-Zalessky of the Russian Academy of Sciences Integration of ideas and methods of Kolmogorov Complexity and classical mathematical statistics	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
17:00 to 17:30	Boris Ryabko Siberian State University of Telecommunications and Information Sciences; Novosibirsk State University Limit capacity of non-stochastic steganographic systems and Hausdorff dimension	Room 1

Friday 6th July 2012
10:00 to 10:30	Kohtaro Tadaki Chuo University Cryptography and Algorithmic Randomness	Room 1
10:30 to 11:00	Morning Coffee	No Room Required
11:00 to 12:00	Andy Lewis University of Leeds The typical Turing degree	Room 1
12:00 to 12:30	Hayato Takahashi University of Electro-Communications Algorithmic randomness and stochastic selection function	Room 1
12:30 to 13:30	Lunch at Wolfson Court	No Room Required
14:00 to 15:00	Adam Day University of California, Berkeley Cupping with random sets	Room 1
15:30 to 16:00	Afternoon Tea	No Room Required
16:00 to 17:00	Rod Downey Victoria University of Wellington Resolute sets and initial segment complexity	Room 1

CCR 2012: 7th conference on computability, complexity and randomness

Speakers

George Barmpalias Chinese Academy of Sciences; Victoria University of Wellington
Bruno Bauwens Universidade do Porto
Vasco Brattka Universität der Bundeswehr München; University of Cape Town
Peter Cholak University of Notre Dame
Adam Day University of California, Berkeley
Rod Downey Victoria University of Wellington
Johanna Franklin University of Connecticut
Pablo Ariel Heiber Universidad de Buenos Aires
Ian Herbert University of California, Berkeley
John Hitchcock University of Wyoming
Mathieu Hoyrup INRIA Paris - Rocquencourt
Michal Koucký Charles University, Prague; Academy of Sciences of the Czech Republic
Andy Lewis University of Leeds
Jack Lutz Iowa State University
Kenshi Miyabe Kyoto University
Phuong Nguyen Université de Montréal
Andre Nies University of Auckland
Tomislav Petrovic Boston University; University of Zagreb
Christopher Porter University of Notre Dame
Zhanna Reznikova Pereslavl-Zalessky of the Russian Academy of Sciences
Jason Rute Carnegie Mellon University
Boris Ryabko Siberian State University of Telecommunications and Information Sciences; Novosibirsk State University
Sam Sanders Universiteit Gent
Alexander Shen Université de Montpellier 2; CNRS (Centre national de la recherche scientifique)
Steve Simpson Pennsylvania State University
Kohtaro Tadaki Chuo University
Hayato Takahashi University of Electro-Communications
Jason Teutsch Pennsylvania State University
Daniel Turetsky Victoria University of Wellington
Marius Zimand Towson University

Show All

CCR 2012: 7th conference on computability, complexity and randomness

Workshop theme

The application is closed

Timetable

Speakers

Supported By

Register for updates