Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72504-6_8 | TAMC |
Keywords | Field | DocType |
oracle a,oracle b,lr degree,lr b,recent result,b-random number | Discrete mathematics,Computer science,Oracle,Mathematical proof | Conference |
Volume | ISSN | Citations |
4484 | 0302-9743 | 1 |
PageRank | References | Authors |
0.38 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| George Barmpalias | 1 | 202 | 34.94 |
| Andrew Lewis | 2 | 90 | 18.10 |
| Mariya Ivanova Soskova | 3 | 21 | 10.54 |