Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
Depth, Highness and DNR degrees
oleh: Philippe Moser, Frank Stephan
Format: | Article |
---|---|
Diterbitkan: | Discrete Mathematics & Theoretical Computer Science 2017-10-01 |
Deskripsi
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-deep K and order-deep C sequences. Our main results are that Martin-Loef random sets are not order-deepC , that every many-one 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 K-trival set is O(1)-deepK.