Volume 52, Issue 1

January 2013

Computability, Complexity and Randomness

Issue Editor:

11 articles in this issue

Computability, Complexity and Randomness
Rod Downey
EditorialNotes 05 October 2012 Pages: 1 - 1
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
Klaus Ambos-Spies
Decheng Ding
Wolfgang Merkle
OriginalPaper 16 September 2012 Pages: 2 - 27
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
Martijn Baartse
George Barmpalias
Report 20 April 2012 Pages: 28 - 47
Effective Randomness of Unions and Intersections
Douglas Cenzer
Rebecca Weber
OriginalPaper 04 July 2012 Pages: 48 - 64
Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures
Willem L. Fouché
OriginalPaper 27 July 2012 Pages: 65 - 79
Time-Bounded Kolmogorov Complexity and Solovay Functions
Rupert Hölzl
Thorsten Kräling
Wolfgang Merkle
OriginalPaper 17 May 2012 Pages: 80 - 94
Dimension Is Compression
María López-Valdés
Elvira Mayordomo
OriginalPaper 21 July 2012 Pages: 95 - 112
Characterization of Kurtz Randomness by a Differentiation Theorem
Kenshi Miyabe
OriginalPaper 05 August 2012 Pages: 113 - 132
Using Ideas of Kolmogorov Complexity for Studying Biological Texts
Boris Ryabko
Zhanna Reznikova
Sofia Panteleeva
OriginalPaper 03 May 2012 Pages: 133 - 147
Axiomatizing Kolmogorov Complexity
Antoine Taveneaux
OriginalPaper 01 April 2012 Pages: 148 - 161
One-Way Functions Using Algorithmic and Classical Information Theories
Luís Antunes
Armando Matos
Andreia Teixeira
OriginalPaper 25 July 2012 Pages: 162 - 178

Search