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

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

by Bjørn Kjos-hanssen , Wolfgang Merkle , Frank Stephan

Citations:

1412	An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
123	Algorithmic randomness and complexity – R Downey, D Hirschfeldt - 2010
38	Every sequence is reducible to a random one – P Gács - 1986
411	Recursively Enumerable Sets and Degrees – Robert I Soare - 1987
67	Lowness Properties and Randomness – André Nies
68	Computability and Randomness – André Nies
34	The fractional dimension of a set defined by decimal properties – H G Eggleston - 1949
44	Π0 1-classes and complete extensions of PA – Measure - 1984
7	Degrees of Random sequences – S M Kautz - 1991
10	Computability and fractal dimension. Doctoral dissertation, Universität – J Reimann - 2004
40	Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity – B Ryabko - 1986
60	A Kolmogorov complexity characterization of constructive Hausdorff dimension – E Mayordomo - 2002
37	Gales and the constructive dimension of individual sequences – J H Lutz
77	The Dimensions of Individual Strings and Sequences – Jack H. Lutz - 2003
15	The complexity of finite objects and the basing of the concepts of information and randomness on the theory of algorithms – A K Zvonkin, L A Levin - 1970
49	Trivial Reals – Rod G. Downey, et al.
103	Π 0 1 classes and degrees of theories – Robert I Soare - 1972
11	Complexity and Randomness – Sebastiaan A. Terwijn - 2003
4	Hausdorff dimension and weak truth-trable reducibility – F Stephan - 2005