Results 1  10
of
11
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 57 (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.
Recursively Enumerable Reals and Chaitin Ω Numbers
"... A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay [23] and Chaitin [10] we say that an r.e. real dominates an r.e. real if from a good approximation of from below one can compute a good approximation of from b ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay [23] and Chaitin [10] we say that an r.e. real dominates an r.e. real if from a good approximation of from below one can compute a good approximation of from below. We shall study this relation and characterize it in terms of relations between r.e. sets. Solovay's [23]like numbers are the maximal r.e. real numbers with respect to this order. They are random r.e. real numbers. The halting probability ofa universal selfdelimiting Turing machine (Chaitin's Ω number, [9]) is also a random r.e. real. Solovay showed that any Chaitin Ω number islike. In this paper we show that the converse implication is true as well: any Ωlike real in the unit interval is the halting probability of a universal selfdelimiting Turing machine.
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 25 (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.
Computable Approximations of Reals: An InformationTheoretic Analysis
 Fundamenta Informaticae
, 1997
"... How fast can one approximate a real by a computable sequence of rationals? We show that the answer to this question depends very much on the information content in the finite prefixes of the binary expansion of the real. Computable reals, whose binary expansions haveavery low information content, ca ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
How fast can one approximate a real by a computable sequence of rationals? We show that the answer to this question depends very much on the information content in the finite prefixes of the binary expansion of the real. Computable reals, whose binary expansions haveavery low information content, can be approximated (very fast) with a computable convergence rate. Random reals, whose binary expansions contain very much information in their prefixes, can be approximated only very slowly by computable sequences of rationals (this is the case, for example, for Chaitin's \Omega numbers) if they can be computably approximated at all. We show that one can computably approximate any computable real also very slowly, with a convergence rate slower than any computable function. However, there is still a large gap between computable reals and random reals: any computable sequence of rationals which converges (monotonically) to a random real converges slower than any computable sequence of rat...
A Characterization of C.E. Random Reals
 THEORETICAL COMPUTER SCIENCE
, 1999
"... A real # is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals; # is random if its binary expansion is a random sequence. Our aim is to offer a selfcontained proof, based on the papers [7, 14, 4, 13], of the following theorem: areal is c.e. and ra ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A real # is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals; # is random if its binary expansion is a random sequence. Our aim is to offer a selfcontained proof, based on the papers [7, 14, 4, 13], of the following theorem: areal is c.e. and random if and only if it a Chaitin# real, i.e., the halting probability of some universal selfdelimiting Turing machine.
A Glimpse into Algorithmic Information Theory
 Logic, Language and Computation, Volume 3, CSLI Series
, 1999
"... This paper is a subjective, short overview of algorithmic information theory. We critically discuss various equivalent algorithmical models of randomness motivating a #randomness hypothesis". Finally some recent results on computably enumerable random reals are reviewed. 1 Randomness: An Informa ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
This paper is a subjective, short overview of algorithmic information theory. We critically discuss various equivalent algorithmical models of randomness motivating a #randomness hypothesis". Finally some recent results on computably enumerable random reals are reviewed. 1 Randomness: An Informal Discussion In which we discuss some di#culties arising in de#ning randomness. Suppose that one is watching a simple pendulum swing back and forth, recording 0 if it swings clockwise at a given instant and 1 if it swings counterclockwise. Suppose further that after some time the record looks as follows: 10101010101010101010101010101010: At this point one would like to deduce a #theory" from the experiment. 1 The #theory" should account for the data presently available and make #predictions" about future observations. How should one proceed? It is obvious that there are many #theories" that one could writedown for the given data, for example: 10101010101010101010101010101010000000000...
Chaitin\Omega numbers, Solovay machines and Godel incompleteness. Theoretical Computer Science
 Theoretical Computer Science
, 2000
"... Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show that every c.e. random real is the halting probability of a universal Chaitin machine for which ZFC cannot determine more than its initial block of 1 bits—as soon as you get a 0, it is all over. Finally, a constructive version of Chaitin informationtheoretic incompleteness
Chaitin Ω numbers, Solovay machines and Gödel incompleteness
 THEORETICAL COMPUTER SCIENCE
, 2002
"... Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show that every c.e. random real is the halting probability of a universal Chaitin machine for which ZFC cannot determine more than its initial block of 1 bits—as soon as you get a 0, it is all over. Finally, a constructive version of Chaitin informationtheoretic incompleteness
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
Recursivelyenumerable reals and Chaitin www.elsevier.com/locate/tcs numbers �;��
, 1998
"... Communicated byM. Ito A real is called recursivelyenumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay(unpublished manuscript, IBM Thomas J. Watson ..."
Abstract
 Add to MetaCart
Communicated byM. Ito A real is called recursivelyenumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay(unpublished manuscript, IBM Thomas J. Watson