Translator Disclaimer
September 2013 Algorithmic randomness and measures of complexity
George Barmpalias
Bull. Symbolic Logic 19(3): 318-350 (September 2013). DOI: 10.2178/bsl.1903020

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.

Citation

Download Citation

George Barmpalias. "Algorithmic randomness and measures of complexity." Bull. Symbolic Logic 19 (3) 318 - 350, September 2013. https://doi.org/10.2178/bsl.1903020

Information

Published: September 2013
First available in Project Euclid: 6 January 2014

zbMATH: 1348.03039
MathSciNet: MR3134896
Digital Object Identifier: 10.2178/bsl.1903020

Rights: Copyright © 2013 Association for Symbolic Logic

JOURNAL ARTICLE
33 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.19 • No. 3 • September 2013
Back to Top