Compactness arguments with effectively closed sets for the study of relative randomness

DOI10.1093/LOGCOM/EXQ036zbMath1253.03069OpenAlexW2153558687MaRDI QIDQ2907048

George Barmpalias

Publication date: 5 September 2012

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

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

zbMATH Keywords

Turing degreesK-trivials\(\Pi ^{0}_{1}\) classesLR-degreesrelative Martin-Löf randomness

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (1)

On the gap between trivial and nontrivial initial segment prefix-free complexity

This page was built for publication: Compactness arguments with effectively closed sets for the study of relative randomness