Kolmogorov complexity and the Recursion Theorem. Manuscript, submitted for publication (2005)

by Bjørn Kjos-hanssen , Wolfgang Merkle , Frank Stephan
Citations:46 - 11 self

Active Bibliography

22 An extension of the recursively enumerable Turing degrees – Stephen G. Simpson - 2006
25 Uniform almost everywhere domination – Peter Cholak, Noam Greenberg, Joseph, S. Miller - 2006
Reconciling Data Compression and . . . – Laurent Bienvenu, Wolfgang Merkle
4 Degrees of Computing and Learning – Frank Stephan - 1999
4 On the Structures Inside Truth-Table Degrees – Frank Stephan - 1997
7 Effectively closed sets of measures and randomness – Jan Reimann
23 A lower cone in the wtt degrees of non-integral effective dimension – André Nies, Jan Reimann - 2006
7 Lowness for weakly 1-generic and Kurtz-random – Frank Stephan, Liang Yu - 2006
1 Schnorr trivial sets and truth-table reducibility – Johanna N. Y. Franklin, Frank Stephan
2 Interactions of Computability and Randomness – André Nies
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
13 Computability and Measure – Sebastiaan Augustinus Terwijn - 1998
1 Report: Bertelsmann wants all of Napster. http://www.usatoday.com/life/cyber/invest/2002/04/05/napster.htm – Sanjay Jain, Frank Stephan, Nan Ye - 2002
8 On the complexity of random strings (Extended Abstract) – Martin Kummer - 1996
Selection by Recursively Enumerable Sets ⋆ – Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang
CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS – Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Dan Turetsky
Recursion Theory – Frank Stephan
2 RANDOMNESS NOTIONS AND PARTIAL RELATIVIZATION – George Barmpalias, Joseph S. Miller, André Nies
1 Jump inversions inside effectively closed sets and applications to randomness – George Barmpalias, Rod Downey, Keng, Meng Ng