Stephen G. Simpson. Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. In Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond, editors, Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Volume 10010 of Lecture Notes in Computer Science, pages 660-668, Springer, 2017. [doi]
@inproceedings{Simpson17,
title = {Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions},
author = {Stephen G. Simpson},
year = {2017},
doi = {10.1007/978-3-319-50062-1_40},
url = {http://dx.doi.org/10.1007/978-3-319-50062-1_40},
researchr = {https://researchr.org/publication/Simpson17},
cites = {0},
citedby = {0},
pages = {660-668},
booktitle = {Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday},
editor = {Adam R. Day and Michael R. Fellows and Noam Greenberg and Bakhadyr Khoussainov and Alexander G. Melnikov and Frances A. Rosamond},
volume = {10010},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-50061-4},
}