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)
68Q25: Analysis of algorithms and problem complexity
94A15: Information theory (general)
03D30: Other degrees and reducibilities in computability and recursion theory
60A05: Axioms; other general questions in probability
Related Items
Several results in program size complexity, Algorithmic entropy of sets, Learning recursive functions from approximations, Algorithmic complexity as a criterion of unsolvability