Incompleteness, Approximation and Relative Randomness
From MaRDI portal
Publication:4904462
DOI10.3233/COM-12014zbMath1282.03020MaRDI QIDQ4904462
Publication date: 30 January 2013
Published in: Computability (Search for Journal in Brave)
Kolmogorov complexity; incompleteness; computably enumerable degrees; Martin-Löf randomness; relative randomness
03D25: Recursively (computably) enumerable sets and degrees
03D32: Algorithmic randomness and dimension