Timeline for What subsets of a set of integers can compute it?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 3, 2017 at 20:56 | comment | added | Todd Eisworth | Mathias forcing works for a consistent "yes" for (2). Thank you for the pointer! | |
| Oct 3, 2017 at 14:08 | comment | added | Denis Hirschfeldt | @MihaHabič A Cohen real itself doesn't work, because if there is a computable $C$ such that $A$ has infinitely many elements in $C$ and infinitely many elements not in $C$ then we can encode $A$ into a coinfinite subset $B$ of $A$ by just letting the $n$th element of $B$ be in $C$ iff $n$ is in $A$. Glancing at Soare's paper quickly, it looks like he uses Mathias forcing. | |
| Oct 2, 2017 at 3:57 | history | answered | Denis Hirschfeldt | CC BY-SA 3.0 |