| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118877 | Annals of Pure and Applied Logic | 2005 | 9 Pages |
Abstract
We prove several results about the existence of sparse sets complete (and hard) for Turing reductions on different settings and complexity classes over the real numbers.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Felipe Cucker,