scientific article; zbMATH DE number 2204767
From MaRDI portal
Publication:5316387
zbMath1075.03020MaRDI QIDQ5316387
Publication date: 12 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
The Kolmogorov complexity of random reals ⋮ A hierarchy of Turing degrees of divergence bounded computable real numbers ⋮ Undecidability of the structure of the Solovay degrees of c.e. reals ⋮ Classification of the Computable Approximations by Divergence Boundings ⋮ On the hierarchies of Δ20-real numbers ⋮ Hierarchy of Computably Enumerable Degrees II ⋮ Classification of computably approximable real numbers