TITLE: What subsets of a set of integers can compute it?
QUESTION [10 upvotes]: For $x, y \subseteq \omega$, 
(a) We write $x \leq_T y$ if $x$ is Turing reducible to $y$.
(b) We write $x \leq_L y$ if $x \in L(y)$ where $L(y)$ is the smallest model of ZFC that contains all ordinals and $y$. Let $L = L(\emptyset)$.
Note that $x \leq_T y \implies x \in L(y)$.
I have two questions.
(1) Is there an infinite $x \subseteq \omega$ such that for every $y \subseteq x$, if $x \leq_T y$ then $x \setminus y$ is finite?
If the answer to (1) is yes, then
(2) Assume $\mathbb{R} \cap L \neq \mathbb{R}$. Does there exist an infinite $x \subseteq \omega$ such that for every $y \subseteq x$, if $x \leq_L y$ then $x \setminus y$ is finite?

REPLY [7 votes]: For (2), what happens if we are in $L[r]$ with $r$ a Sacks real?  Since this has minimal degree, all non-constructible $x\subseteq\omega$ have the same degree of constructibility, and if we split a non-constructible set into two disjoint pieces, at least one must be non-constructible.  This would be a consistent "no" answer for (2), as we may split any infinite subset of $\omega$ into two infinite pieces.
Edit:  
Denis' comment on Mathias forcing got me to thinking, and a look back at Mathias' original "Happy Families" paper has what we need for a consistent "yes" answer to (2).
In particular, Theorem 8.2 of the paper tells us exactly what we want: if $F$ is a Ramsey ultrafilter in $L$ and $X$ is Mathias generic over $L$ with respect to $F$, then $Z\subseteq X$ and $X\leq_L Z$ implies $X\setminus Z$ is finite.
So (2) is actually independent of ZFC.
Note as well that (2) has a positive answer if the set of constructible reals is countable, as any infinite pseudo-intersection for the filter generated by $F$ in $V$ is Mathias generic over $L$ for $F$.