CHAITIN’S Ω AS A CONTINUOUS FUNCTION

We prove that the continuous function Ω̂ : 2 → R that is defined via X 7→ ∑ n 2 −K(X n) for all X ∈ 2 is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that ∫ 1 0 Ω̂(X) dX is a left-c.e. wtt-complete real having effective Hausdorff dimension 1/2. We further investigate the algorithmic properties of Ω̂. For example, we show that the maximal value of Ω̂ must be random, the minimal value must be Turing complete, and that Ω̂(X)⊕X ≥T ∅′ for every X. We also obtain some machine-dependent results, including that for every ε > 0, there is a universal machine V such that Ω̂V maps every real X having effective Hausdorff dimension greater than ε to a real of effective Hausdorff dimension 0 with the property that X ≤tt Ω̂V (X); and that there is a real X and a universal machine V such that ΩV (X) is rational.

[1]  George Barmpalias,et al.  Analogues of Chaitin's Omega in the computably enumerable sets , 2013, Inf. Process. Lett..

[2]  George Barmpalias,et al.  Random numbers as probabilities of machine behavior , 2017, Theor. Comput. Sci..

[3]  Verónica Becher,et al.  Random reals and possibly infinite computations Part I: Randomness in ∅′ , 2005, Journal of Symbolic Logic.

[4]  Rodney G. Downey,et al.  Kolmogorov Complexity and Solovay Functions , 2009, STACS.

[5]  R. Soare Recursively enumerable sets and degrees , 1987 .

[6]  Liang Yu,et al.  On initial segment complexity and degrees of randomness , 2008 .

[7]  George Barmpalias,et al.  Aspects of Chaitin's Omega , 2017, ArXiv.

[8]  Jing Zhang,et al.  Using Almost-everywhere theorems from Analysis to Study Randomness , 2014, Bull. Symb. Log..

[9]  Xizhong Zheng,et al.  Solovay Reducibility on D-c.e Real Numbers , 2005, COCOON.

[10]  George Barmpalias,et al.  The Probability of a Computable Output from a Random Oracle , 2016, ACM Trans. Comput. Log..

[11]  André Nies,et al.  Relativizing Chaitin's Halting Probability , 2005, J. Math. Log..

[12]  Noam Greenberg,et al.  COMPUTING K-TRIVIAL SETS BY INCOMPLETE RANDOM SETS , 2013, The Bulletin of Symbolic Logic.

[13]  André Nies,et al.  Denjoy, Demuth and density , 2013, J. Math. Log..

[14]  Santiago Figueira,et al.  Randomness and halting probabilities , 2006, Journal of Symbolic Logic.

[15]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[16]  Joseph S. Miller,et al.  The K-Degrees, Low for K Degrees, and Weakly Low for K Sets , 2009, Notre Dame J. Formal Log..

[17]  Denis R. Hirschfeldt,et al.  Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[18]  Wolfgang Merkle,et al.  Time-Bounded Kolmogorov Complexity and Solovay Functions , 2009, Theory of Computing Systems.