scientific article; zbMATH DE number 5057386
From MaRDI portal
zbMath1100.68042MaRDI QIDQ5489365
Publication date: 26 September 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
martingalesKolmogorov complexityincompressibilitylownesscomputabilitycomputably enumerableprefix-free complexitydegrees of unsolvability
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items