On sparseness, reducibilities, and complexity

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.