Book contents
- Frontmatter
- Contents
- Preface
- 1 Key developments in algorithmic randomness
- 2 Algorithmic randomness in ergodic theory
- 3 Algorithmic randomness and constructive/computable measure theory
- 4 Algorithmic randomness and layerwise computability
- 5 Relativization in randomness
- 6 Aspects of Chaitin’s Omega
- 7 Biased algorithmic randomness
- 8 Higher randomness
- 9 Resource bounded randomness and its applications
- Index
5 - Relativization in randomness
Published online by Cambridge University Press: 07 May 2020
- Frontmatter
- Contents
- Preface
- 1 Key developments in algorithmic randomness
- 2 Algorithmic randomness in ergodic theory
- 3 Algorithmic randomness and constructive/computable measure theory
- 4 Algorithmic randomness and layerwise computability
- 5 Relativization in randomness
- 6 Aspects of Chaitin’s Omega
- 7 Biased algorithmic randomness
- 8 Higher randomness
- 9 Resource bounded randomness and its applications
- Index
Summary
We discuss the different contexts in which relativization occurs in randomness and the effect that the relativization chosen has on the results we can obtain. We study several characterizations of the K-trivials in terms of concepts ranging from cuppability to density, and we consider a uniform relativization for randomness that gives us more natural results for computable randomness, Schnorr randomness, and Kurtz randomness than the classical relativization does (the relativization for Martin-Löf randomness is unaffected by this change). We then evaluate the relativizations we have considered and suggest some avenues for further work.
Keywords
- Type
- Chapter
- Information
- Algorithmic RandomnessProgress and Prospects, pp. 134 - 174Publisher: Cambridge University PressPrint publication year: 2020