Abstract
A real α is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real α is random if its binary expansion is a random sequence. Our aim is to offer a self-contained proof, based on the papers (Calude et al., in: M. Morvan, C. Meinel, D. Krob (Eds.), Proc. 15th Symp. on Theoretical Aspects of Computer Science, Paris, Springer, Berlin, 1998, pp. 596–606; Chaitin, J. Assoc. Comput. Mach. 22 (1975) 329; Slaman, manuscript, 14 December 1998, 2 pp.; Solovay, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp.), of the following theorem: a real is c.e. and random if and only if it is a Chaitin Ω real, i.e., the halting probability of some universal self-delimiting Turing machine.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
