Abstract
We have already seen that Chaitin’s Ω is a natural example of a 1-random real. We have also seen that, in algorithmic randomness, prefix-free machines are the analogs of partial computable functions, and the measures of the domains of prefix-free machines, that is, left computably enumerable reals, take the role of the computably enumerable sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Downey, R.G., Hirschfeldt, D.R. (2010). Ω as an Operator. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-68441-3_15
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95567-4
Online ISBN: 978-0-387-68441-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)