Ausgabe 1/2013
Computability, Complexity and Randomness
Inhalt (11 Artikel)
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
Martijn Baartse, George Barmpalias
Time-Bounded Kolmogorov Complexity and Solovay Functions
Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle
Using Ideas of Kolmogorov Complexity for Studying Biological Texts
Boris Ryabko, Zhanna Reznikova, Alexey Druzyaka, Sofia Panteleeva
One-Way Functions Using Algorithmic and Classical Information Theories
Luís Antunes, Armando Matos, Alexandre Pinto, André Souto, Andreia Teixeira