Abstract
In this chapter, we explore some of the relationships between \(\Pi_1^0\) classes, algorithmic randomness, and computably dominated degrees.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soare, R.I. (2016). Randomness and \(\Pi_1^0\)-Classes. In: Turing Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31933-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31933-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31932-7
Online ISBN: 978-3-642-31933-4
eBook Packages: Computer ScienceComputer Science (R0)