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