Abstract
We show that given any non-computable left-c.e. real \(\alpha \) there exists a left-c.e. real \(\beta \) such that \(\alpha \ne \beta +\gamma \) for all left-c.e. reals and all right-c.e. reals \(\gamma \). The proof is non-uniform, the dichotomy being whether the given real \(\alpha \) is Martin-Löf random or not. It follows that given any universal machine U, there is another universal machine V such that the halting probability \(\Omega _U\) of U is not a translation of the halting probability \(\Omega _V\) of V by a left-c.e. real. We do not know if there is a uniform proof of this fact.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Barmpalias was supported by the 1000 Talents Program for Young Scholars from the Chinese Government, and the Chinese Academy of Sciences (CAS) President’s International Fellowship Initiative No. 2010Y2GB03. Additional support was received by the CAS and the Institute of Software of the CAS. Partial support was also received from a Marsden grant of New Zealand and the China Basic Research Program (973) grant No. 2014CB340302. Lewis-Pye was supported by a Royal Society University Research Fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. J. Complex. 16(4), 676–690 (2000)
Barmpalias, G., Downey, R., Greenberg, N.: Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees. Trans. Am. Math. Soc. 362(2), 777–813 (2010)
Bennett, C.H.: Logical depth and physical complexity. In: The Universal Turing Machine: A Half-Century Survey, pp. 227–257. Oxford University Press (1988)
Barmpalias, G., Lewis-Pye, A.: Differences of halting probabilities. arXiv:1604.00216 [cs.CC], April 2016
Calude, C., Hertling, P., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin \(\Omega \) numbers. Theor. Comput. Sci. 255(1–2), 125–149 (2001)
Calude, C., Nies, A.: Chaitin \(\Omega \) numbers, strong reducibilities. J. UCS 3(11), 1162–1166 (1997)
Cooper, S.B.: Degrees of Unsolvability. PhD thesis, Leicester University (1971)
Demuth, O.: On constructive pseudonumbers. Comment. Math. Univ. Carolinae 16, 315–331 (1975). In Russian
Downey, R.G., Hirshfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010)
Downey, R.G., Hirschfeldt, D.R., Nies, A.: Randomness, computability, and density. SIAM J. Comput. 31, 1169–1183 (2002)
Downey, R.G., Guohua, W., Zheng, X.: Degrees of d.c.e. reals. Math. Log. Q. 50(4–5), 345–350 (2004)
Figueira, S., Stephan, F., Guohua, W.: Randomness and universal machines. J. Complex. 22(6), 738–751 (2006)
Kučera, A., Slaman, T.: Randomness and recursive enumerability. SIAM J. Comput. 31(1), 199–211 (2001)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Graduate Texts in Computer Science, 2nd edn. Springer, New York (1997)
Ng, K.-M.: Some properties of d.c.e. reals and their Degrees. M.Sc. thesis, National University of Singapore (2006)
Nies, A.: Computability and Randomness. Oxford University Press, 444 pp. (2009)
Raichev, A.: Relative randomness and real closed fields. J. Symb. Log. 70(1), 319–330 (2005)
Solovay, R.: Handwritten manuscript related to Chaitin’s work. IBM Thomas J. Watson Research Center, Yorktown Heights, 215 pages (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Barmpalias, G., Lewis-Pye, A. (2017). A Note on the Differences of Computably Enumerable Reals. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-50062-1_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50061-4
Online ISBN: 978-3-319-50062-1
eBook Packages: Computer ScienceComputer Science (R0)