Relative randomness and cardinality
From MaRDI portal
Publication:985004
DOI10.1215/00294527-2010-012zbMath1231.03038OpenAlexW1998078201MaRDI QIDQ985004
Publication date: 20 July 2010
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/00294527-2010-012
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (6)
Randomness notions and partial relativization ⋮ Universal computably enumerable sets and initial segment prefix-free complexity ⋮ On the gap between trivial and nontrivial initial segment prefix-free complexity ⋮ Elementary differences between the degrees of unsolvability and degrees of compressibility ⋮ Kolmogorov complexity of initial segments of sequences and arithmetical definability ⋮ Chaitin's halting probability and the compression of strings using oracles
This page was built for publication: Relative randomness and cardinality
