Publication:3418262
From MaRDI portal
zbMath1121.68058MaRDI QIDQ3418262
Publication date: 2 February 2007
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D15: Complexity of computation (including implicit computational complexity)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
03D80: Applications of computability and recursion theory
28E15: Other connections with logic and set theory
03D28: Other Turing degree structures
Related Items
Unnamed Item, Strong jump-traceability. II: \(K\)-triviality, Fractal dimension versus process complexity, The Medvedev lattice of computably closed sets, Exact constructive and computable dimensions, On partial randomness
