Program size, oracles, and the jump operation
From MaRDI portal
Publication:1238725
zbMath0359.94031MaRDI QIDQ1238725
Publication date: 1977
Published in: Osaka Journal of Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Other degrees and reducibilities in computability and recursion theory (03D30) Axioms; other general questions in probability (60A05)
Related Items
Algorithmic complexity as a criterion of unsolvability ⋮ Learning recursive functions from approximations ⋮ Several results in program size complexity ⋮ Algorithmic entropy of sets
