Computer Science – Information Theory
Scientific paper
2010-04-05
Computer Science
Information Theory
12 pages, no figures, to appear in the Proceedings of the 9th International Conference on Unconventional Computation (UC 2010)
Scientific paper
In 1975 Chaitin introduced his \Omega number as a concrete example of random real. The real \Omega is defined based on the set of all halting inputs for an optimal prefix-free machine U, which is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed \Omega to be random by discovering the property that the first n bits of the base-two expansion of \Omega solve the halting problem of U for all binary inputs of length at most n. In this paper, we introduce a new representation \Theta of Chaitin \Omega number. The real \Theta is defined based on the set of all compressible strings. We investigate the properties of \Theta and show that \Theta is random. In addition, we generalize \Theta to two directions \Theta(T) and \bar{\Theta}(T) with a real T>0. We then study their properties. In particular, we show that the computability of the real \Theta(T) gives a sufficient condition for a real T in (0,1) to be a fixed point on partial randomness, i.e., to satisfy the condition that the compression rate of T equals to T.
No associations
LandOfFree
A new representation of Chaitin Ωnumber based on compressible strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new representation of Chaitin Ωnumber based on compressible strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new representation of Chaitin Ωnumber based on compressible strings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-637520