Incompleteness, Approximation and Relative Randomness
From MaRDI portal
Publication:4904462
DOI10.3233/COM-12014zbMath1282.03020OpenAlexW1949710668MaRDI QIDQ4904462
Publication date: 30 January 2013
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-12014
Kolmogorov complexityincompletenesscomputably enumerable degreesMartin-Löf randomnessrelative randomness
Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)