Algorithmic randomness and measures of complexity

DOI10.2178/BSL.1903020zbMath1348.03039OpenAlexW2150210116MaRDI QIDQ2870106

George Barmpalias

Publication date: 17 January 2014

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2c22e03166884e48055ad909eabfaa394285c0db

zbMATH Keywords

survey paper

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (3)

Relating and contrasting plain and prefix Kolmogorov complexity ⋮ STRONG JUMP-TRACEABILITY ⋮ Coherence of reducibilities with randomness notions

This page was built for publication: Algorithmic randomness and measures of complexity