Working with the LR degrees
Barmpalias, G., Lewis-Pye, A. & Soskova, M.
(2007).
Working with the LR degrees.
In
Cai, J., Cooper, S. B. & Zhu, H.
(Eds.),
Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007
(pp. 89-99).
Springer Berlin / Heidelberg.
https://doi.org/10.1007/978-3-540-72504-6_8
We say that A ≤ LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on γ. In other words, B is at least as good as A for this purpose. We propose a methodology for studying the LR degrees and present a number of recent results of ours, including sketches of their proofs.
| Item Type | Chapter |
|---|---|
| Copyright holders | © 2007 Springer |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1007/978-3-540-72504-6_8 |
| Date Deposited | 06 Aug 2013 |
| URI | https://researchonline.lse.ac.uk/id/eprint/51436 |
Explore Further
- https://www.scopus.com/pages/publications/35448999232 (Scopus publication)
- http://link.springer.com/bookseries/558 (Official URL)