| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9518077 | Advances in Mathematics | 2005 | 32 Pages |
Abstract
Answering a further question in P. Cholak, S. Lempp, M. Lerman, R. Shore, (Eds.), Computability Theory and Its Applications: Current Trends and Open Problems, American Mathematical Society, Providence, RI, 2000, we prove that each low for computably random set is computable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
Authors
André Nies,