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

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

Documents Related by Co-Citation

158 Algorithmic Randomness and Complexity – Rod Downey, Denis Hirshfeldt - 2010
79 Lowness Properties and Randomness – André Nies
1689 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
94 Computability and Randomness – André Nies
333 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
42 Every sequence is reducible to a random one – Péter Gács - 1986
475 Recursively Enumerable Sets and Degrees – R Soare - 1987
47 Π 0 1 classes, and complete extensions of PA – Measure - 1984
59 Information-Theoretic Characterizations of Recursive Infinite Strings – Gregory J. Chaitin - 1976
57 Trivial Reals – Rod G. Downey, et al.
126 Π0 1 classes and degrees of theories – Robert I Soare - 1972
6 Array nonrecursive sets and genericity – Rod Downey, Carl G Jockusch, Michael Stob - 1996
11 Computability and fractal dimension. Doctoral dissertation, Universität – Jan Reimann - 2004
73 A Kolmogorov complexity characterization of constructive Hausdorff dimension Infor – E Mayordomo
59 Calibrating randomness – Rod Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan, A. Terwijn
308 Classical Recursion Theory – P Odifreddi - 1989
21 and André Nies. Randomness and computability: open questions – Joseph S Miller
28 classes and complete extensions of – A Kucera, Measure - 1985
7 Degrees of Random Sequences – S M Kautz - 1991