Incomputable sets of low degree vs Rices theorem?


I have heard that there are sets that are not computable, but are lower in degree than the halting problem.

How does this not contradict Rices theorem? Are there any concrete examples of such sets?