Abstract
We study Bennett deep sequences in the context of recursion theory; in particular we investigate the notions of O(1)-deepK, O(1)-deepC, order-deepK and order-deepC sequences. Our main results are that Martin-Löf random sets are not order-deepC, that every manyone degree contains a set which is not O(1)-deepC, that O(1)-deepC sets and order-deepK sets have high or DNR Turing degree and that no Ktrival set is O(1)-deepK.
Cite
CITATION STYLE
Moser, P., & Stephan, F. (2015). Depth, highness and DNR degrees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9210, pp. 81–94). Springer Verlag. https://doi.org/10.1007/978-3-319-22177-9_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
