scientific article; zbMATH DE number 5252382
From MaRDI portal
Publication:5448294
zbMath1135.03340MaRDI QIDQ5448294
Publication date: 20 March 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Related Items
On randomness, determinism and computability, Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega, On the relation between descriptional complexity and algorithmic probability
