Low upper bounds in the Turing degrees revisited
From MaRDI portal
Publication:2907049
DOI10.1093/logcom/exq035zbMath1309.03017OpenAlexW2128835879MaRDI QIDQ2907049
Publication date: 5 September 2012
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exq035
Complexity of computation (including implicit computational complexity) (03D15) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
This page was built for publication: Low upper bounds in the Turing degrees revisited
