$$\textit{K}$$-trivial, $$\textit{K}$$-low and $${{\mathrm{\textit{MLR}}}}$$-low Sequences: A Tutorial

DOI10.1007/978-3-319-23534-9_1zbMath1466.68048arXiv1407.4259OpenAlexW2962807961WikidataQ57349405 ScholiaQ57349405MaRDI QIDQ2947163

Laurent Bienvenu, Alexander Shen

Publication date: 22 September 2015

Published in: Fields of Logic and Computation II (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.4259

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Lowness properties and randomness
• Lowness notions, measure and domination
• Algorithmic Randomness and Complexity
• Kolmogorov Complexity and Algorithmic Randomness
• Using random sets as oracles

This page was built for publication: $$\textit{K}$$-trivial, $$\textit{K}$$-low and $${{\mathrm{\textit{MLR}}}}$$-low Sequences: A Tutorial