Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2007) Working with the LR degrees. In: Cai, Jin-Yi, Cooper, S. Barry and Zhu, Hong, (eds.) Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007. Lecture notes in computer science (4484). Springer Berlin / Heidelberg, Berlin, pp. 89-99. ISBN 9783540725039
Full text not available from this repository.Abstract
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: | Book Section |
|---|---|
| Official URL: | http://link.springer.com/bookseries/558 |
| Additional Information: | © 2007 Springer |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 06 Aug 2013 11:25 |
| Last Modified: | 02 Jan 2024 03:12 |
| URI: | http://eprints.lse.ac.uk/id/eprint/51436 |
Actions (login required)
 |
View Item |
