Abstract
In this chapter, we look at the distribution of 1-random and n-random degrees among the Turing (and other) degrees. Among the major results we discuss are the Kučera-G´acs Theorem 8.3.2 [167, 215] that every set is computable from a 1-random set; Theorem 8.8.8, due to Barmpalias, Lewis, and Ng [24], that every PA degree is the join of two 1-random degrees; and Stillwell’s Theorem 8.15.1 [382] that the “almost all” theory of degrees is decidable. The latter uses Theorem 8.12.1, due to de Leeuw, Moore, Shannon, and Shapiro [92], that if a set is c.e. relative to positive measure many sets, then it is c.e. This result has as a corollary the fundamental result, first explicitly formulated by Sacks [341], that if a set is computable relative to positive measure many sets, then it is computable. Its proof will introduce a basic technique called the majority vote technique.
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.
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 subscriptionsPreview
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). Algorithmic Randomness and Turing Reducibility. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-68441-3_8
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)