Article contents
Algorithmic Randomness and Measures of Complexity
Published online by Cambridge University Press: 05 September 2014
Abstract
We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2013
References
REFERENCES
- 2
- Cited by