Journées Calculabilités 2013

April 11 and 12 (Thursday and Friday), Nancy

Bruno Bauwens. The Kolmogorov complexity of on-line predicting odd and even bits.
Laurent Bienvenu. Higher randomness and triviality.
Hugo Férée. On the query complexity of real functionals. [slides]
Benjamin Hellouin. Characterizing typical asymptotic behaviours of cellular automata. [slides]
Neil Jones. Programs = data = first-class citizens in a computational world.
Gregory Lafitte. The necessary use of determinacy assumptions in a computability result.
Ludovic Patey. New results in the reverse mathematics analysis of Ramsey theory.
Christopher Porter. Randomness and semi-measures. [slides]
Amaury Pouly. The General Purpose Analog Computer (GPAC) and computable analysis.
Paul Shafer. A low DNR(k) function that computes no DNR(2) function. [slides]
Antoine Taveneaux. Randomized algorithms to compute completions of Peano arithmetic.