Abstract

Solovay showed that there are noncomputable reals ff such that H(ff _ n) 6 H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the connection between algorithmic complexity and effective randomness. We give a new, easier construction of an H-trivial real. We also analyze various computability-theoretic properties of the H-trivial reals, showing for example that no H-trivial real can compute the halting problem. Therefore, our construction of an H-trivial computably enumerable set is an easy, injury-free construction of an incomplete computably enumerable set. Finally, we relate the H-trivials to other classes of "highly nonrandom " reals that have been previously studied.

Citations

1412	An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitanyi - 1997
914	On computable numbers, with an application to the ”Entscheidungsproblem - Turing - 1936
411	Recursively Enumerable Sets and Degrees - Soare - 1987
294	The definition of random sequences - Martin-Löf
274	A theory of program size formally identical to information theory - Chaitin - 1975
123	Algorithmic randomness and complexity - Downey, Hirschfeldt - 2010
58	Degrees of unsolvability - Sacks - 1963
58	Randomness and recursive enumerability - Slaman
55	Information-theoretic characterizations of recursive infinite strings - Chaitin - 1976
54	Draft of a paper (or series of papers) on Chaitin’s work. Unpublished notes - Solovay - 1975
50	Schnorr randomness - Downey, Griffiths
42	Counting Complexity - Fortnow - 1997
42	Randomness and Genericity in the Degrees of Unsolvability - Kurtz - 1981
42	Computational Complexity of Real Functions - Ko - 1991
39	A variant of the Kolmogorov concept of complexity - Loveland - 1969
37	Degrees of Random Sets - Kautz - 1991
32	A formal theory of inductive inference - Solomono - 1964
28	Lowness for the class of random sets - Kučera, Terwijn - 1999
27	Randomness in computability theory - Ambos-Spies, Kučera - 1999
26	Array nonrecursive sets and multiple permitting arguments - Downey, Jockusch, et al. - 1990
26	Reals which compute little - Nies - 2006
20	Array nonrecursive degrees and genericity - Downey, Jockusch, et al. - 1996
19	Randomness and reducibility - Downey, Hirschfeldt, et al.
19	Kolmogorov complexity and instance complexity of recursively enumerable sets - Kummer - 1996
19	Various measures of complexity for finite objects (axiomatic description - Levin - 1976
16	On the use of diagonally nonrecursive functions - Kučera - 1987
15	The weak truth table degrees of recursively enumerable sets - Ladner, Sasso - 1975
12	Randomness, computability and density - Downey, Hirschfeldt, et al.
10	Information Theory and Randomness, an Algorithmic Perspective - Calude - 1994
10	0 2 degrees and transfer theorems - Downey - 1987
9	Algorithmic randomness and lowness - Terwijn, Zambella
9	Chaitin � numbers and strong reducibilities - Nies - 1997
8	Lowness properties of reals and randomness - Nies - 2002
8	Recursively enumerable reals and - Calude, Hertling, et al. - 1998
7	Weak recursive degrees and a problem of Spector - Ishmukhametov - 1997
7	On sequences with simple initial segments - ZAMBELLA - 1990
4	On relative randomness, Annals of Pure and Applied Logic 63 - Kucera - 1993
3	Aspects of Complexity (Short courses in complexity from the New - Downey, Hirschfeldt - 2001
2	Low for random sets are \Delta 02 - Nies - 2002
1	Low for random sets are - Nies - 2002
1	A computably enumerable undecidable set with low prefix complexity: a simplified proof - Vereshchagin
1	Kolmogorov complexity, in [6], 73-86. [13] S. Ishmukhametov, Weak recursive degrees and a problem of - Fortnow - 1999
1	Lowness properties of reals and randomness, to appear. [24] A. Nies, Reals which compute little, to appear. [25] G. Sacks, Degrees of Unsolvability - Nies - 1963