Timeline for Sets meeting and avoiding computable sets
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 6, 2023 at 4:35 | vote | accept | Dan Turetsky | ||
| Jan 5, 2023 at 21:00 | comment | added | YCor | "A set"... you mean, a subset of the set of integers? | |
| Jan 5, 2023 at 18:46 | answer | added | Bjørn Kjos-Hanssen | timeline score: 2 | |
| Jan 5, 2023 at 2:57 | comment | added | Joel David Hamkins | I was thinking that perhaps a fusion argument would enable you to prove it also couldn't compute one. Only countably many programs, and the fusion argument can handle them one at a time. | |
| Jan 5, 2023 at 2:55 | comment | added | Dan Turetsky | A Sacks-generic real won't itself be hesive, but it might compute one. I'll think on that a bit. | |
| Jan 5, 2023 at 2:44 | comment | added | Joel David Hamkins | Do you know what happens with a Sacks-generic real? | |
| Jan 5, 2023 at 2:13 | comment | added | Joel David Hamkins | Interesting question +1. Your title refers to "meeting and avoid computable sets", but the property is about computable sets meeting and avoiding $X$. | |
| Jan 5, 2023 at 2:04 | history | asked | Dan Turetsky | CC BY-SA 4.0 |