(Almost) Lowness for K and finite selfinformation
(Herbert, I / University of California, Berkeley)



Alan Turing in the twentyfirst century: normal numbers, randomness, and finite automata
(Lutz, J / Iowa State University)



Algorithmic randomness and stochastic selection function
(Takahashi, H / University of ElectroCommunications, Tokyo)



Autoreducibility for NEXP
(Nguyen, D / University at Buffalo)



Computable randomness and its properties
(Rute, J / Carnegie Mellon University)



Computably enumerable partial orders
(Cholak, P / University of Notre Dame)



Cryptography and Algorithmic Randomness
(Tadaki, K / Chuo University)



Cupping with random sets
(Day, A / University of California, Berkeley)



Demuth randomness and its variants
(Nies, A / University of Auckland)



Exact pairs for the ideal of the Ktrivial sequences in the Turing degrees
(Barmpalias, G / Chinese Academy of Sciences)



Integration of ideas and methods of Kolmogorov Complexity and classical mathematical statistics
(Reznikova, Z / Novosibirsk State University)



Kolmogorov complexity and Fourier aspects of Brownian motion
(Fouche, W / University of South Africa)



Language compression for sets in P/poly
(Zimand, M / Towson University)



Limit capacity of nonstochastic steganographic systems and Hausdorff dimension
(Ryabko, D / INRIA, Lille, France)



Limitations of Efficient Reducibility to the Kolmogorov Random Strings
(Hitchcock, J M / University of Wyoming)



Nonstandard Analysis: a new way to compute
(Sanders, S / Universiteit Gent)



Normality and Differentiability
(Heiber, P A / Universidad de Buenos Aires)



On the computational content of the Baire Category Theorem
(Brattka, V / University of Cape Town)



Prefix and plain Kolmogorov complexity characterizations of 2randomness: simple proofs
(Bauwens, B / Universidade do Porto)



Propagation of partial randomness
(Simpson, S / Pennsylvania State University)



Resolute sets and initial segment complexity
(Downey, R / Victoria University of Wellington)



Schnorr triviality is equivalent to being a basis for ttSchnorr randomness
(Miyabe, K / Kyoto University)



SJThardness and pseudojump inversion
(Turetsky, D / Victoria University of Wellington)



The typical Turing degree
(Lewis, A / University of Leeds)



Topological arguments in Kolmogorov complexity
(Shen, A / Université de Montpellier 2)



Trivial measures are not so trivial
(Porter, C / University of Notre Dame)



Two betting strategies that predict all compressible sequences
(Petrovic, T / University of Zagreb)



Back to top of page 
