Results 1 
1 of
1
Trivial Reals
"... Solovay showed that there are noncomputable reals ff such that H(ff _ n) 6 H(1n) + O(1), where H is prefixfree Kolmogorov complexity. Such Htrivial reals are interesting due to the connection between algorithmic complexity and effective randomness. We give a new, easier construction of an Htrivi ..."
Abstract

Cited by 56 (31 self)
 Add to MetaCart
Solovay showed that there are noncomputable reals ff such that H(ff _ n) 6 H(1n) + O(1), where H is prefixfree Kolmogorov complexity. Such Htrivial reals are interesting due to the connection between algorithmic complexity and effective randomness. We give a new, easier construction of an Htrivial real. We also analyze various computabilitytheoretic properties of the Htrivial reals, showing for example that no Htrivial real can compute the halting problem. Therefore, our construction of an Htrivial computably enumerable set is an easy, injuryfree construction of an incomplete computably enumerable set. Finally, we relate the Htrivials to other classes of &quot;highly nonrandom &quot; reals that have been previously studied.