Timeline for Cupping and capping for 0’ relative to a recursively enumerable set
Current License: CC BY-SA 4.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 13, 2020 at 15:52 | vote | accept | Peter Gerdes | ||
Jul 13, 2020 at 15:52 | comment | added | Peter Gerdes | Ohh, is your suggestion I choose e to be the index of a construction such that H_e(X) and H_j(X) always yield a minimal paid over X or non-trivially join to X' and now I get 0' to be one half of that pair. Hm, ok yah those are both uniform constructions. THANKS!! | |
Jul 13, 2020 at 15:43 | comment | added | Peter Gerdes | I’m sure I’m missing something (and maybe I used wrong terminology) but how does that get me a B r.e. in A (but not equivalent to A') such that B+A + 0' is equivalent to A'? Or so that B+A and 0' form a minimal paid over A? | |
Jul 12, 2020 at 23:54 | history | answered | Theodore Slaman | CC BY-SA 4.0 |