Abstract
Chaitin [G. J. Chaitin, J. Assoc. Comput. Mach., vol. 22, pp. 329–340, 1975] introduced his Ω number as a concrete example of random real. The real Ω is defined as the probability that an optimal computer halts, where the optimal computer is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed Ω to be random by discovering the property that the first n bits of the base-two expansion of Ω solve the halting problem of the optimal computer for all binary inputs of length at most n. In the present paper we investigate this property from various aspects. It is known that the base-two expansion of Ω and the halting problem are Turing equivalent. We consider elaborations of both the Turing reductions which constitute the Turing equivalence. These elaborations can be seen as a variant of the weak truth-table reduction, where a computable bound on the use function is explicitly specified. We thus consider the relative computational power between the base-two expansion of Ω and the halting problem by imposing the restriction to finite size on both the problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Calude, C.S., Hertling, P.H., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin Ω numbers. Theoret. Comput. Sci. 255, 125–149 (2001)
Chaitin, G.J.: A theory of program size formally identical to information theory. J. Assoc. Comput. Mach. 22, 329–340 (1975)
Chaitin, G.J.: Algorithmic Information Theory. Cambridge University Press, Cambridge (1987)
Chaitin, G.J.: Program-size complexity computes the halting problem. Bulletin of the European Association for Theoretical Computer Science 57, 198 (1995)
Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg (to appear)
Kučera, A., Slaman, T.A.: Randomness and recursive enumerability. SIAM J. Comput. 31(1), 199–211 (2001)
Miller, J., Yu, L.: On initial segment complexity and degrees of randomness. Trans. Amer. Math. Soc. 360, 3193–3210 (2008)
Nies, A.: Computability and Randomness. Oxford University Press, New York (2009)
Solovay, R.M.: Draft of a paper (or series of papers) on Chaitin’s work.. done for the most part during the period of September–December 1974, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, pp. 215 (May 1975) (unpublished manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tadaki, K. (2009). Chaitin Ω Numbers and Halting Problems. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)