Results 1 
5 of
5
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 "highly nonrandom " reals that have been previously studied.
Some ComputabilityTheoretical Aspects of Reals and Randomness
 the Lect. Notes Log. 18, Assoc. for Symbol. Logic
, 2001
"... We study computably enumerable reals (i.e. their left cut is computably enumerable) in terms of their spectra of representations and presentations. ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We study computably enumerable reals (i.e. their left cut is computably enumerable) in terms of their spectra of representations and presentations.
Presentations of computably enumerable reals
 Theoretical Computer Science
, 2002
"... Abstract We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefixfree set of binary strings. ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Abstract We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefixfree set of binary strings.
Computably enumerable reals and uniformly presentable ideals
 Mathematical Logic Quarterly
"... We study the relationship between a computably enumerable real and its presentations. A set A presents a computably enumerable real α if A is a computably enumerable prefixfree set of strings such that α = ∑ σ∈A 2−σ . Note that ∑ σ∈A 2−σ  is precisely the measure of the set of reals that have a ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We study the relationship between a computably enumerable real and its presentations. A set A presents a computably enumerable real α if A is a computably enumerable prefixfree set of strings such that α = ∑ σ∈A 2−σ . Note that ∑ σ∈A 2−σ  is precisely the measure of the set of reals that have a string in A as an initial segment. So we will simply abbreviate ∑ σ∈A 2−σ  by µ(A). It is known that whenever A so presents α then A ≤wtt α, where ≤wtt denotes weak truth table reducibility, and that the wtt degrees of presentations form an ideal I(α) in the computably enumerable wtt degrees. We prove that any such ideal is Σ 0 3, and conversely that if I is any Σ 0 3 ideal in the computably enumerable wtt degrees then there is a computable enumerable real α such that I = I(α). 1
Algorithmic Randomness and Computability
"... Abstract. We examine some recent work which has made significant progress in out understanding of algorithmic randomness, relative algorithmic randomness and their relationship with algorithmic computability and relative algorithmic computability. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We examine some recent work which has made significant progress in out understanding of algorithmic randomness, relative algorithmic randomness and their relationship with algorithmic computability and relative algorithmic computability.